Fetching the paper…

Reading the bibliography…

2014

Efficient synthesis of probabilistic quantum circuits with fallback

Bocharov, Alex, Roetteler, Martin, Svore, Krysta M.

Original
PDF
Post on X

Understand

Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford+$T$ gate set.

In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+$T$ gate set.
The protocol, which we call Probabilistic Quantum Circuits with Fallback (PQF), implements a walk on a discrete Markov chain in which the target unitary is an absorbing state and in which transitions are induced by multi-qubit unitaries followed by measurements.
In contrast to RUS protocols, the presented PQF protocols terminate after a finite number of steps.

Efficient synthesis of probabilistic quantum circuits with fallback · Around

Built on

W. Schmidt, Diophantine Approximation (Springer-Verlag, Berlin, Heidelberg, 1980)
1980
Earlier work this paper cites.
G. Duclos-Cianci and K. M. Svore, Phys. Rev. A 88
Original
1980
Earlier work this paper cites.
L. Washington, Introduction to Cyclotomic Fields (Springer,New-York, 1997)
1997
Earlier work this paper cites.
J. Norris, Markov Chains (Cambridge University Press, Cambridge, UK, 1998)
1998
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2000)
2000
Earlier work this paper cites.
P. Bertok, “PSLQ integer relation algorithm implementation,” (2004), http://library.wolfram.com/infocenter/MathSource/4263/
2004
Earlier work this paper cites.
S. Bravyi and A. Y. Kitaev, Physical Review A 71
2005
Earlier work this paper cites.
C. Dawson and M. Nielsen, Quantum Information and Computation 6
2006
Earlier work this paper cites.

Similar

K. Matsumoto and K. Amano, “Representation of quantum circuits with Clifford and π / 8 \pi/8 gates,” (2008)
Original
2008
Cited alongside, same era.
P. Selinger, “Efficient Clifford+T approximation of single-qubit operators,” (2012), 1212.6253
Original
2012
Cited alongside, same era.
V. Kliuchnikov, D. Maslov, and M. Mosca, “Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits,” (2012), 1212.6964
Original
2012
Cited alongside, same era.
A. Bocharov and K. M. Svore, Phys. Rev. Lett. 109
Original
2012
Cited alongside, same era.
A. Meier, B. Eastin, and E. Knill, “Magic-state distillation with the four-qubit code,” (2012), 1204.4221

Then

V. Kliuchnikov, D. Maslov, and M. Mosca, Quantum Information and Computation 13(7,8)
Original
2013
Later among the works it cites.
S. Bravyi and J. Haah, “Magic state distillation with low overhead,” (2013), 1209.2426
Original
2013
Later among the works it cites.
N. Ross and P. Selinger, “Optimal ancilla-free Clifford+T approximation of z-rotations,” (2014), 1403.2975
Original
2014
Closest in time.
A. Bocharov, M. Roetteler, and K. Svore, “Efficient synthesis of universal Repeat-Until-Success circuits,” (2014), 1404.5320
Original
2014
Closest in time.
A. Bocharov and Y. Gurevich, “A note on optimal ancilla-free v-circuits for axial rotations,” (2014, in preparation)

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

2012

Cited alongside, same era.

V. Kliuchnikov, “Synthesis of unitaries with Clifford+T circuits,” (2013), 1306.3200

2013

Cited alongside, same era.

A. Paetznick and K. Svore, “Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries,” (2013), 1311.1074

2013

Cited alongside, same era.

A. Bocharov, M. Gurevich, and K. Svore, “Efficient decomposition of single-qubit gates into V V basis circuits,” (2013), 1303.1411

2013

Cited alongside, same era.

B. Giles and P. Selinger, “Remarks on Matsumoto and Amano’s normal form for single-qubit Clifford+T operators,” (2013a), 1312.6584

Cited in the paper.

H. Ferguson and D. Bailey, “A polynomial time, numerically stable integer relation algorithm,” http://crd.lbl.gov/ dhbailey/dhbpapers/pslq.pdf

Cited in the paper.

B. Giles and P. Selinger, Phys. Rev. A 87

Cited in the paper.

2014

Closest in time.

N. J. Ross, “Optimal ancilla-free Pauli+ V V approximation of z z -rotations,” (2014), 1409.4355

2014

Closest in time.

S. X. Cui and Z. Wang, “Universal quantum computation with metaplectic anyons,” (2014), 1405.7778

2014

Closest in time.

G. Duclos-Cianci and D. Poulin, “Reducing the quantum computing overhead with complex gate distillation,” (2014), 1403.5280

2014

Closest in time.