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 (105)

• Quantum Computing in the NISQ era and beyond
• Fault-tolerant quantum computation by anyons
• Non-Abelian Anyons and Topological Quantum Computation
• Elementary gates for quantum computation
• The density-matrix renormalization group in the age of matrix product states
• Surface codes: Towards practical large-scale quantum computation
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Many-body localization, thermalization, and entanglement
• A Quantum Approximate Optimization Algorithm
• Adiabatic Quantum Computing
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Computing with Very Noisy Devices
• Majorana Zero Modes and Topological Quantum Computation
• Parameterized quantum circuits as machine learning models
• Entanglement renormalization
• Measurement-based quantum computation
• Shortcuts to adiabaticity: concepts, methods, and applications
• A Theory of Fault-Tolerant Quantum Computation
• A high-bias, low-variance introduction to Machine Learning for physicists
• Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order
• Quantum metrology from a quantum information science perspective
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Symmetry Fractionalization, Defects, and Gauging of Topological Phases
• Quantum computations without definite causal structure
• Theoretical framework for quantum networks
• Universal blind quantum computation
• Universal computation by multi-particle quantum walk
• Restrictions on Transversal Encoded Quantum Gate Sets
• Non-Abelian adiabatic statistics and Hall viscosity in quantum Hall states and p_x+ip_y paired superfluids
• Quasi-adiabatic Continuation of Quantum States: The Stability of Topological Ground State Degeneracy and Emergent Gauge Invariance
• Quantum Circuits Architecture
• A fault-tolerant one-way quantum computer
• Programmable quantum gate arrays
• 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
• Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
• The General Quantum Interference Principle and the Duality Computer
• Simulation of topological field theories by quantum computers
• Novel schemes for measurement-based quantum computation
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• General optimality of the Heisenberg limit for quantum metrology
• Topology and Broken Symmetry in Floquet Systems
• The power of quantum systems on a line
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Symmetry-protected phases for measurement-based quantum computation
• The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
• Memory effects in quantum channel discrimination
• Decoherence in adiabatic quantum computation
• Index theory of one dimensional quantum walks and cellular automata
• Optimal quantum learning of a unitary transformation
• Quantum Holonomies for Quantum Computing
• A review of Quantum Cellular Automata
• Matrix Product Unitaries: Structure, Symmetries, and Topological Invariants
• Efficient use of quantum resources for the transmission of a reference frame
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Quantum computation with Turaev-Viro codes
• General conditions for approximate quantum error correction and near-optimal recovery channels
• Reversible quantum cellular automata
• Universal Quantum Hamiltonians
• A computationally universal phase of quantum matter
• On the energy landscape of 3D spin Hamiltonians with topological order
• Continuous symmetries and approximate quantum error correction
• Computational Power of Symmetry-Protected Topological Phases
• Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
• Renormalization group constructions of topological quantum liquids and beyond
• A Universal Training Algorithm for Quantum Deep Learning
• Adiabatic Theorem for Quantum Spin Systems
• Hamiltonian Quantum Cellular Automata in 1D
• Quantum simulators, continuous-time automata, and translationally invariant systems
• A quantum cellular automaton for universal quantum computation
• Revisiting the simulation of quantum Turing machines by quantum circuits
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• Classification of Quantum Cellular Automata
• Local Unitary Quantum Cellular Automata
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Quantum Nondemolition Monitoring of Universal Quantum Computers
• Error Correction of Quantum Reference Frame Information
• New perspectives on covariant quantum error correction
• Quantum Circuits for Measuring Levin-Wen Operators
• Optimal universal programming of unitary gates
• Remarks on Universal Quantum Computer
• The Group Structure of Quantum Cellular Automata
• Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians
• Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
• Quantum Origami: Transversal Gates for Quantum Computation and Measurement of Topological Order
• Universal 2-local Hamiltonian Quantum Computing
• Resource Quantification for the No-Programming Theorem
• Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
• Modular transformations through sequences of topological charge projections
• Time Independent Universal Computing with Spin Chains: Quantum Plinko Machine
• Quasi-exact quantum computation
• Measurement-only topological quantum computation without forced measurements
• General conditions for universality of Quantum Hamiltonians
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• Topological qubits from valence bond solids
• Quantum Random Access Stored-Program Machines
• Quantum Turing Machines Computations and Measurements
• Universal Quantum Computation by Scattering in the Fermi-Hubbard Model
• Quantum computation by teleportation and symmetry
• Fault-tolerant conversion between stabilizer codes by Clifford operations
• Classes of topological qubits from low-dimensional quantum spin systems

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