Diagonal quantum circuits: their computational power and applications
arXiv:1405.6552 · doi:10.1140/epjp/i2014-14152-9
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 (11)
- Aspects of generic entanglement
- Randomizing quantum states: Constructions and applications
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Matchgates and classical simulation of quantum circuits
- Superdense coding of quantum states
- Statistical distribution of quantum entanglement for a random bipartite state
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- Exact convergence times for generation of random bipartite entanglement
- Emergence of typical entanglement in two-party random processes
- Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
- Efficient algorithm for multi-qudit twirling for ensemble quantum computation