A comparative study of universal quantum computing models: towards a physical unification

Abstract

Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight connections with fundamental physics. Although being developed decades ago, a physically concise principle or picture to formalize and understand UQCM is still lacking. This is challenging given the diversity of still-emerging models, but important to understand the difference between classical and quantum computing. In this work, we carried out a primary attempt to unify UQCM by classifying a few of them as two categories, hence making a table of models. With such a table, some known models or schemes appear as hybridization or combination of models, and more importantly, it leads to new schemes that have not been explored yet. Our study of UQCM also leads to some insights into quantum algorithms. This work reveals the importance and feasibility of systematic study of computing models.

References in corpus (26)

• Non-Abelian Anyons and Topological Quantum Computation
• The density-matrix renormalization group in the age of matrix product states
• Surface codes: Towards practical large-scale quantum computation
• A Quantum Approximate Optimization Algorithm
• Quantum metrology from a quantum information science perspective
• Universal computation by multi-particle quantum walk
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum Circuits Architecture
• A Grand Unification of Quantum Algorithms
• Transforming quantum operations: quantum supermaps
• Quantum Low-Density Parity-Check Codes
• Measurement-Only Topological Quantum Computation
• A classification of symmetry enriched topological phases with exactly solvable models
• Novel schemes for measurement-based quantum computation
• General optimality of the Heisenberg limit for quantum metrology
• The power of quantum systems on a line
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
• Decoherence in adiabatic quantum computation
• Reversible quantum cellular automata
• Hamiltonian Quantum Cellular Automata in 1D
• Quantum simulators, continuous-time automata, and translationally invariant systems
• Local Unitary Quantum Cellular Automata
• Quantum Circuits for Measuring Levin-Wen Operators
• Measurement-only topological quantum computation without forced measurements
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes

Cited by in corpus (8)

• Compilation of algorithm-specific graph states for quantum circuits
• A prototype of quantum von Neumann architecture
• Universal resources for quantum computing
• Exploiting Anyonic Behavior of Quasicrystals for Topological Quantum Computing
• Quantum resource theory of coding for error correction
• Quantum circuit simulation of superchannels
• Experimental simulation of quantum superchannels
• State-adaptive quantum error correction and fault-tolerant quantum computing