Efficient discrete approximations of quantum gates

DOI10.1063/1.1495899zbMath1060.81517arXivquant-ph/0111031OpenAlexW3104711177MaRDI QIDQ4832734

Isaac Chuang, Aram W. Harrow, Benjamin Recht

Publication date: 14 December 2004

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0111031

Mathematics Subject Classification ID

Related Items (16)

Calculable lower bounds on the efficiency of universal sets of quantum gates ⋮ On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem ⋮ How smooth is quantum complexity? ⋮ Optimal ancilla-free Pauli+V circuits for axial rotations ⋮ Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets ⋮ Universality of single-qudit gates ⋮ Mathematical etudes on quantum computation ⋮ Hay from the haystack: explicit examples of exponential quantum circuit complexity ⋮ Martin-Löf randomness, invariant measures and countable homogeneous structures ⋮ Unnamed Item ⋮ AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS ⋮ Floating point representations in quantum circuit synthesis ⋮ On the spectral gap for finitely-generated subgroups of \(\text{SU}(2)\) ⋮ ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES ⋮ Quantum branching programs and space-bounded nonuniform quantum complexity ⋮ Quantum algorithms for algebraic problems

Cites Work

• Bounds for Kac's master equation
• Hecke operators and distributing points on the sphere I
• Hecke operators and distributing points on S². II
• Reliable quantum computers
• Quantum computations: algorithms and error correction
• Quantum Complexity Theory
• Quantum information theory
• Universality in quantum computation
• Quantum information and computation

This page was built for publication: Efficient discrete approximations of quantum gates