Floating point representations in quantum circuit synthesis

DOI10.1088/1367-2630/15/9/093041MaRDI QIDQ5141571zbMATH OpenOpenAlexWikidataFDO

Authors Nathan Wiebe, Vadym Kliuchnikov

Publication date 18 December 2020

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum computation (81P68)

Abstract: We provide a non-deterministic quantum protocol that approximates the single qubit rotations R_x(2a^2 b^2)$ using R_x(2a) and R_x(2b) and a constant number of Clifford and T operations. We then use this method to construct a "floating point" implementation of a small rotation wherein we use the aforementioned method to construct the exponent part of the rotation and also to combine it with a mantissa. This causes the cost of the synthesis to depend more strongly on the relative (rather than absolute) precision required. We analyze the mean and variance of the Tcount required to use our techniques and provide new lower bounds for the T-count for ancilla free synthesis of small single-qubit axial rotations. We further show that our techniques can use ancillas to beat these lower bounds with high probability. We also discuss the T-depth of our method and see that the vast majority of the cost of the resultant circuits can be shifted to parallel computation paths.

Recommendations

• T-count optimized quantum circuit for floating point addition and multiplication
• Optimal ancilla-free Pauli+V circuits for axial rotations
• Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
• SAT-based {CNOT, \(T\)} quantum circuit synthesis
• Quantum circuits for floating-point arithmetic

Cites work

• Efficient discrete approximations of quantum gates
• Efficient discrete-time simulations of continuous-time quantum query algorithms
• Faster quantum chemistry simulation on fault-tolerant quantum computers
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 6131346 (Why is no real title available?)
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• The Solovay--Kitaev algorithm
• Universal Quantum Simulators

Cited in

(5)

• T-count optimized quantum circuit for floating point addition and multiplication
• On the power of coherently controlled quantum adiabatic evolutions
• Optimal ancilla-free Pauli+V circuits for axial rotations
• Ancilla-approximable quantum state transformations
• Groups of diagonal gates in the Clifford hierarchy

This page was built for publication: Floating point representations in quantum circuit synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141571)