Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits

DOI10.1109/TC.2015.2409842zbMath1360.81112arXiv1212.6964OpenAlexW3101222183MaRDI QIDQ2985686

Michele Mosca, Dmitri Maslov, Vadym Kliuchnikov

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.6964

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (15)

Calculable lower bounds on the efficiency of universal sets of quantum gates ⋮ Improving ancilla states for quantum computation ⋮ Improved reversible and quantum circuits for Karatsuba-based integer multiplication. ⋮ Mathematical etudes on quantum computation ⋮ Improving the implementation of quantum blockchain based on hypergraphs ⋮ Quantum speedup of Monte Carlo integration with respect to the number of dimensions and its application to finance ⋮ Deterministic algorithms for compiling quantum circuits with recurrent patterns ⋮ Unnamed Item ⋮ An Introduction to Quantum Computing, without the Physics ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians ⋮ Revisiting the simulation of quantum Turing machines by quantum circuits ⋮ Canonical forms for single-qutrit Clifford+\(T\) operators ⋮ Structural stability of the quantum Fourier transform ⋮ Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians ⋮ Syndrome measurement strategies for the \(7,1,3\) code

This page was built for publication: Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits