Diagonal quantum circuits: their computational power and applications

Abstract

Diagonal quantum circuits are quantum circuits comprising only diagonal gates in the computational basis. In spite of a classical feature of diagonal quantum circuits in the sense of commutativity of all gates, their computational power is highly likely to outperform classical one and they are exploited for applications in quantum informational tasks. We review computational power of diagonal quantum circuits and their applications. We focus on the computational power of instantaneous quantum polynomial-time (IQP) circuits, which are a special type of diagonal quantum circuits. We then review an approximate generation of random states as an application of diagonal quantum circuits, where random states are an ensemble of pure states uniformly distributed in a Hilbert space. We also present a thermalizing algorithm of classical Hamiltonians by using diagonal quantum circuits. These applications are feasible to be experimentally implemented by current technology due to a simple and robust structure of diagonal gates.

14 pages, 3 figures, review paper. ver.2: References were added. Fig 1 was replaced with a new one

References in corpus (43)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Average Entropy of a Subsystem
• Symmetric Informationally Complete Quantum Measurements
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• The capacity of the noisy quantum channel
• Canonical Typicality
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• On the role of entanglement in quantum computational speed-up
• Classical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity
• Superadditivity of communication capacity using entangled inputs
• From Quantum Dynamics to the Canonical Distribution: General Picture and a Rigorous Example
• Induced measures in the space of mixed quantum states
• Aspects of generic entanglement
• Quantum Data Hiding
• Randomizing quantum states: Constructions and applications
• Optimal Encryption of Quantum Bits
• Random Quantum Circuits are Approximate 2-designs
• Quantum Metropolis Sampling
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Hiding bits in Bell states
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Matchgates and classical simulation of quantum circuits
• Thermalization in Nature and on a Quantum Computer
• Superdense coding of quantum states
• Instantaneous Quantum Computation
• Efficient Generation of Generic Entanglement
• Statistical distribution of quantum entanglement for a random bipartite state
• Phase Transitions in the Distribution of Bipartite Entanglement of a Random Pure State
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Phase transitions of bipartite entanglement
• Exact convergence times for generation of random bipartite entanglement
• Emergence of typical entanglement in two-party random processes
• Large Deviation Bounds for k-designs
• Phase transitions and metastability in the distribution of the bipartite entanglement of a large quantum system
• On almost randomizing channels with a short Kraus decomposition
• Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
• Generating a state $t$-design by diagonal quantum circuits
• Efficient algorithm for multi-qudit twirling for ensemble quantum computation
• Approximate Randomization of Quantum States With Fewer Bits of Key
• Phase-random states: ensembles of states with fixed amplitudes and uniformly distributed phases in a fixed basis
• Measurement-Based Quantum Computation on Symmetry Breaking Thermal States
• Local random quantum circuits are approximate polynomial-designs - numerical results
• Diagonal-unitary 2-designs and their implementations by quantum circuits

Cited by in corpus (16)

• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Quantum Commuting Circuits and Complexity of Ising Partition Functions
• State preparation by shallow circuits using feed forward
• Magic of quantum hypergraph states
• Entanglement of random hypergraph states
• The principle of majorization: application to random quantum circuits
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count
• Decoupling with random diagonal unitaries
• A graphical calculus for integration over random diagonal unitary matrices
• Quantifying multiparticle entanglement with randomized measurements
• Quantum tomography with random diagonal unitary maps and statistical bounds on information generation using random matrix theory
• Characterization, synthesis, and optimization of quantum circuits over multiple-control $\text{Z}$-rotation gates: A systematic study
• Thermal states of random quantum many-body systems
• Phase context decomposition of diagonal unitaries for higher-dimensional systems
• Computational quantum-classical boundary of complex and noisy quantum systems
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks