Zobrazeno 21 - 30
of 444
pro vyhledávání: '"Chakrabarti, Amlan"'
Publikováno v:
Phys. Rev. A , volume: 106 (2022)
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood constraint
Externí odkaz:
http://arxiv.org/abs/2106.09089
Publikováno v:
SN COMPUT. SCI. 2, 427 (2021)
With the evolution of quantum computing, researchers now-a-days tend to incline to find solutions to NP-complete problems by using quantum algorithms in order to gain asymptotic advantage. In this paper, we solve $k$-coloring problem (NP-complete pro
Externí odkaz:
http://arxiv.org/abs/2105.14281
Autor:
Paul, Rourab, Sarkar, Sreetama, Sau, Suman, Chakraborty, Koushik, Roy, Sanghamitra, Chakrabarti, Amlan
The exponential emergence of Field Programmable Gate Array (FPGA) has accelerated the research of hardware implementation of Deep Neural Network (DNN). Among all DNN processors, domain specific architectures, such as, Google's Tensor Processor Unit (
Externí odkaz:
http://arxiv.org/abs/2102.06888
Publikováno v:
Phys. Rev. A, volume: 105 (2022)
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm can be ext
Externí odkaz:
http://arxiv.org/abs/2012.04447
The magnificence grandeur of quantum computing lies in the inherent nature of quantum particles to exhibit true parallelism, which can be realized by indubitably fascinating theories of quantum physics. The possibilities opened by quantum computation
Externí odkaz:
http://arxiv.org/abs/2010.08053
Publikováno v:
IET Quantum Communication 2021
Ant colony optimization (ACO) is a commonly used meta-heuristic to solve complex combinatorial optimization problems like traveling salesman problem (TSP), vehicle routing problem (VRP), etc. However, classical ACO algorithms provide better optimal s
Externí odkaz:
http://arxiv.org/abs/2010.07413
Publikováno v:
2020 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS)
Nowadays in Quantum Computing, the implementation of quantum algorithm has created a stir since Noisy Intermediate-Scale Quantum (NISQ) devices are out in the market. Researchers are mostly interested in solving NP-complete problems with the help of
Externí odkaz:
http://arxiv.org/abs/2009.06073
In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but implementation involve
Externí odkaz:
http://arxiv.org/abs/2007.06804
The growing sophistication of cyber attacks, vulnerabilities in high computing systems and increasing dependency on cryptography to protect our digital data make it more important to keep secret keys safe and secure. Few major issues on secret keys l
Externí odkaz:
http://arxiv.org/abs/2007.06201
Publikováno v:
IEEE Transactions on Quantum Engineering ( Volume: 2) 2021
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here we present one dimensional three-state quantum walk(lazy quantum walk) and show its equivalence for circuit realization in ternary quantum logic for
Externí odkaz:
http://arxiv.org/abs/2006.09712