2 code implementations • 26 Jul 2019 • Guang Hao Low, Vadym Kliuchnikov, Nathan Wiebe
We introduce well-conditioned multiproduct formulas, which are a linear combination of product formulas, where a single step has polynomial cost $\mathcal{O}(m^2\log{(m)})$ and succeeds with probability $\Omega(1/\operatorname{log}^2{(m)})$.
Quantum Physics Computational Physics
1 code implementation • 22 Jun 2012 • Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring $\mathbb{Z}[\frac{1}{\sqrt{2}}, i]$, in the single-qubit case.
Quantum Physics Emerging Technologies
1 code implementation • 31 Dec 2012 • Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
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.
Quantum Physics Emerging Technologies
no code implementations • 3 Dec 2018 • Guang Hao Low, Vadym Kliuchnikov, Luke Schaeffer
We present a quantum algorithm for preparing any dimension-$N$ pure quantum state specified by a list of $N$ classical numbers, that realizes a trade-off between space and T-gates.
Quantum Physics
