Filters








147 Hits in 6.1 sec

Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures [article]

Raphael Seidel, Colin Kai-Uwe Becker, Sebastian Bock, Nikolay Tcholtchev, Ilie-Daniel Gheorge-Pop, Manfred Hauswirth
2021 arXiv   pre-print
Moreover, the automatic generation of the corresponding circuits for a Grover quantum oracle is deeply linked to the synthesis of reversible quantum logic, which - despite numerous advances in the field  ...  Quantum oracles that are frequently masked as black boxes play an important role in Grover's algorithm. Hence, the automatic generation of oracles is of paramount importance.  ...  for arbitrary data structures: 1) The current paper presents an overall structure of a procedure for the automatic generation of Grover oracles, which is based on truth tables and belonging quantum logic  ... 
arXiv:2110.07545v1 fatcat:dpak5btghnhslfcko36ownquau

Modelling of Grover's quantum search algorithms: implementations of Simple quantum simulators on classical computers

Sergey Ulyanov, Andrey Reshetnikov, Olga Tyatyushkina
2020 System Analysis in Science and Education  
A general quantum computation on an isolated system can be represented by a unitary matrix.  ...  There are different universal gate sets for quantum computation. Here we choose the universal gate set consisting of CNOT and single-qubit gates.  ...  The circuit for constructing an arbitrary Boolean function is not provided. The circuit is devised that allows generating an Oracle automatically in a high-level programming language in the kernel.  ... 
doi:10.37005/2071-9612-2020-3-65-128 fatcat:kaayol3i45fmnlekmlt3zwj2ge

Improving Gate-Level Simulation of Quantum Circuits [article]

George F. Viamontes, Igor L. Markov, John P. Hayes
2003 arXiv   pre-print
However, by using a novel data structure called the Quantum Information Decision Diagram (QuIDD) that exploits the structure of quantum operators, a useful subset of operator matrices and state vectors  ...  Finally, we empirically validate QuIDD-based simulation by means of a general-purpose quantum computing simulator QuIDDPro implemented in C++.  ...  s BDD representations cannot simulate arbitrary quantum circuits, the idea of modeling quantum states with a BDD-based structure is appealing and motivates our approach.  ... 
arXiv:quant-ph/0309060v2 fatcat:skyc3fc3wvgfpnkrhjkir65q74

Quantum Discrete Cosine Transform for Image Compression [article]

Chao Yang Pang, Zheng Wei Zhou, Guang Can Guo
2006 arXiv   pre-print
This paper presents a quantum DCT iteration, and constructs a quantum 1-D and 2-D DCT algorithm for image compression by using the iteration.  ...  In addition, the method presented in this paper generalizes the famous Grover's algorithm to solve complex unstructured search problem.  ...  Han for his encouragement to us. We thank Yong-Jian Han, Pin-Xing Chen and Yun-Feng Huang especially for the significant discussing with them. We would also like to thank Yong-Shen Zhang  ... 
arXiv:quant-ph/0601043v2 fatcat:d23vo3pt7jarvbq43ri2zivf7i

Three-qubit exact Grover within the blind oracular quantum computation scheme [article]

Cica Gustiani, David P. DiVincenzo
2019 arXiv   pre-print
that the oracle part of the quantum computation can also be executed blindly.  ...  We develop tests of this protocol using two- and three-qubit versions of the exact Grover algorithm (i.e., with database sizes $4\leq N\leq 8$), obtaining optimal implementations of these algorithms within  ...  We acknowledge the support of Forschungzentrum Jülich for the access to JURECA and RWTH Aachen for the access to clusters.  ... 
arXiv:1902.05534v1 fatcat:wollqank5ja3lbb72hwlo6ia6i

Multi-objective evolutionary algorithms for quantum circuit discovery [article]

Václav Potoček, Alan P. Reynolds, Alessandro Fedrizzi, David W. Corne
2018 arXiv   pre-print
As such, the idea of developing automated tools for algorithm development is even more appealing for quantum computing than for classical.  ...  Here we develop a robust, multi-objective evolutionary search strategy to design quantum circuits 'from scratch', by combining and parameterizing a task-generic library of quantum circuit elements.  ...  ACKNOWLEDGEMENTS The work reported here was supported by the Networked Quantum Information Technologies (NQIT) project, a 'Quantum Hub' led by the University of Oxford, and funded by the EPSRC's UK National  ... 
arXiv:1812.04458v1 fatcat:oigt34tabzblnh4djm5ktybpmi

A Quantum Solution for Efficient Use of Symmetries in the Simulation of Many-Body Systems [article]

Albert T. Schmitz, Sonika Johri
2019 arXiv   pre-print
We discuss explicitly the full circuit implementation of Grover minimization as applied to this problem, finding that the oracle only scales as polylog in the size of the group, which acts as the search  ...  rate, improving the utility of the algorithm in the Noisy Intermediate Scale Quantum era.  ...  ACKNOWLEDGEMENTS The authors would like to thank Jim Held, Justin Hogaboam, Anne Matsuura, and Xiang Zou for useful discussion. ATS would also like to thank Rahul M. Nandkishore.  ... 
arXiv:1902.08625v2 fatcat:kju2oyk2cba6zposu23qe5vbnq

Circuit Design for K-coloring Problem and it's Implementation on Near-term Quantum Devices [article]

Amit Saha, Debasri Saha, Amlan Chakrabarti
2020 arXiv   pre-print
Researchers are mostly interested in solving NP-complete problems with the help of quantum algorithms for its speed-up.  ...  in generalizing our approach.  ...  AutoGenOracle K-color algorithm automatically generates Oracle circuit for K-coloring problem using Grover search and is based on newly designed comparator.  ... 
arXiv:2009.06073v1 fatcat:wtuvnldze5gljdwfg565ijh52e

A quantum solution for efficient use of symmetries in the simulation of many-body systems

Albert T. Schmitz, Sonika Johri
2020 npj Quantum Information  
We discuss explicitly the full circuit implementation of Grover minimization as applied to this problem, finding that the oracle only scales as polylog in the size of the group, which acts as the search  ...  rate, improving the utility of the algorithm in the Noisy Intermediate Scale Quantum era. npj Quantum Information (2020) 6:2 ; https://doi.  ...  ACKNOWLEDGEMENTS The authors would like to thank Jim Held, Justin Hogaboam, Anne Matsuura and Xiang Zou for useful discussion. A.T.S. would also like to thank Rahul M. Nandkishore.  ... 
doi:10.1038/s41534-019-0232-1 fatcat:2d7uvxm4c5grdbpmq7n6kl7woq

Qumin, a minimalist quantum programming language [article]

Alexander Singh, Konstantinos Giannakis, Theodore Andronikos
2017 arXiv   pre-print
like matrix and oracle generators that streamline the interaction of the classical and quantum fragments of a program.  ...  This allows the classical part of the language to be freely used for general programming while placing restrictions on the quantum part that enforce rules of quantum computing like the no-cloning of qubits  ...  data structures, oracles, handling of measurement, and handling of quantum memory/registers.  ... 
arXiv:1704.04460v1 fatcat:4hpir6pn2jf3thobgnbb2wut2q

Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target

Artur Scherer, Benoît Valiron, Siun-Chuon Mau, Scott Alexander, Eric van den Berg, Thomas E. Chapuran
2017 Quantum Information Processing  
We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev.  ...  of a quantum algorithm.  ...  Acknowledgements This work was accomplished as part of the PLATO Project: "Protocols, Languages and Tools for resource-efficient Quantum Computation," which was conducted within the scope of IARPA Quantum  ... 
doi:10.1007/s11128-016-1495-5 fatcat:d4pgsoca75bv5fsjiym3o5xgmi

Gate-Level Simulation of Quantum Circuits [article]

George F. Viamontes, Manoj Rajagopalan, Igor L. Markov, John P. Hayes
2002 arXiv   pre-print
The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures.  ...  This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.  ...  Although Greve's BDD representation isn't scalable and doesn't result in compression improvements for arbitrary quantum circuits, the idea of applying a BDD-like structure has considerable merit in the  ... 
arXiv:quant-ph/0208003v1 fatcat:c3stjnybbvhupje6vxhadmxvpe

Toward an architecture for quantum programming

S. Bettelli, T. Calarco, L. Serafini
2003 European Physical Journal D : Atomic, Molecular and Optical Physics  
This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language  ...  with a set of quantum primitives.  ...  Once this task will be accomplished, it will be a very valuable tool both for testing operation times before a real quantum computer is available and for automatic generation of control instructions for  ... 
doi:10.1140/epjd/e2003-00242-2 fatcat:fg3q7mdrvndijfn5kln4moedqu

Extending Python for Quantum-Classical Computing via Quantum Just-in-Time Compilation [article]

Thien Nguyen, Alexander J. McCaskey
2021 arXiv   pre-print
The use of Python has enabled quick prototyping for quantum code that directly benefits pertinent research and development efforts in quantum scientific computing.  ...  The quantum software community has adopted Python on a number of large-scale efforts due to these characteristics, as well as the remote nature of near-term quantum processors.  ...  Specifically, the run _ grover kernel implements a generic Grover's algorithm for arbitrary quantum oracles provided as a callable argument.  ... 
arXiv:2105.04671v1 fatcat:wncqhtruqvcgle3fx5lcokctfa

Demonstration of two-qubit algorithms with a superconducting quantum processor

L. DiCarlo, J. M. Chow, J. M. Gambetta, Lev S. Bishop, B. R. Johnson, D. I. Schuster, J. Majer, A. Blais, L. Frunzio, S. M. Girvin, R. J. Schoelkopf
2009 Nature  
Here we demonstrate a two-qubit superconducting processor and the implementation of the Grover search and Deutsch-Jozsa quantum algorithms.  ...  This interaction allows generation of highly-entangled states with concurrence up to 94%.  ...  The uncertainties correspond to the standard deviation in 16 repetitions of generation-tomography for each entangler.NATURE and b) and transmission data (not shown) for the Q L -cavity vacuum Rabi splitting  ... 
doi:10.1038/nature08121 pmid:19561592 fatcat:mf6waxpz7ja57i5nnnzt4qlxc4
« Previous Showing results 1 — 15 out of 147 results