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

2015/03/09 by Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca · 11 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata

paper · doi:10.1109/tc.2015.2409842

Abstract

We present an algorithm, along with its implementation that finds T-optimal approximations of single-qubit Z-rotations using quantum circuits consisting of Clifford and T gates. Our algorithm is capable of handling errors in approximation down to size 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-15</sup> , resulting in the optimal single-qubit circuit designs required for implementation of scalable quantum algorithms. Our implementation along with the experimental results are available in the public domain.

Cited by

• Aligning Quantum Operators with Large Language Models
• Bounds in the Projective Unitary Group with Respect to Global Phase Invariant Metric
• Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learning
• Transversal STAR architecture for megaquop-scale quantum simulation with neutral atoms
• Qubit-optimal quantum phase estimation of block-encoded Hamiltonians
• First-Quantized Quantum Simulation of Non-Relativistic QED with Emergent Topologically Protected Coulomb Interactions
• Reducing Quantum Circuit Synthesis to #SAT
• Efficient decomposition methods for controlled-R n using a single ancillary qubit. [europepmc]
• Revisiting the simulation of quantum Turing machines by quantum circuits. [europepmc]
• CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries. [europepmc]
• A universal framework for the quantum simulation of Yang-Mills theory. [europepmc]

Related

• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
• A Framework for Approximating Qubit Unitaries
• Efficient Clifford+T approximation of single-qubit operators
• Halving the cost of quantum multiplexed rotations
• An algorithm for the T-count