Fetching the paper…

Reading the bibliography…

2017

Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise?

Yung, Man-Hong, Gao, Xun

Original
PDF
Post on X

Understand

Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently simulable with any classical computer.

This status is known as quantum supremacy (or quantum advantage), where one of the promising approaches is through the sampling of chaotic quantum circuits.
Sampling of ideal chaotic quantum circuits has been argued to require an exponential time for classical devices.
A major question is whether quantum supremacy can be maintained under noise without error correction, as the implementation of fault-tolerance would cost lots of extra qubits and quantum gates.

Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise? · Around

Built on

C. E. Porter and R. G. Thomas, Phys. Rev. 104
1956
Earlier work this paper cites.
R. P. Feynman, Int. J. Theor. Phys. 21
1982
Earlier work this paper cites.
S. Lloyd, Science 273
1996
Earlier work this paper cites.
E. Knill and R. Laflamme, Phys. Rev. Lett. 81
1998
Earlier work this paper cites.
L. G. Valiant, in Proc. thirty-third Annu. ACM Symp. Theory Comput. - STOC ’01 , Vol. 31 (ACM Press, New York, New York, USA, 2001) pp. 114–123
2001
Earlier work this paper cites.

Similar

A. Y. Kitaev, A. Shen, and M. N. Vyalyi, Classical and Quantum Computation , Graduate studies in mathematics (American Mathematical Society, 2002)
2002
Cited alongside, same era.
B. M. Terhal and D. P. DiVincenzo, Phys. Rev. A 65
2002
Cited alongside, same era.
R. Jozsa and A. Miyake, Proc. R. Soc. A Math. Phys. Eng. Sci. 464
Original
2008
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , Quantum Computation and Quantum Information (Cambridge University Press, 2011)
2011
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, Proc. R. Soc. A Math. Phys. Eng. Sci. 467
Original
2011
Cited alongside, same era.
D. Gottesman, arXiv:9807006 [quant-ph]
Cited in the paper.
M. Schwarz and M. V. den Nest, arXiv:1310.6749
Original
Cited in the paper.
E. Knill, arXiv:0108033 [quant-ph]
Cited in the paper.
M.-H. Yung, X. Gao, and J. Huh, arXiv:1608.00383
Original
Cited in the paper.
J. Preskill, arXiv:1203.5813
Original
Cited in the paper.
A. P. Lund, M. J. Bremner, and T. C. Ralph, arXiv:1702.03061
Original
Cited in the paper.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, arXiv:1610.01808
Original
Cited in the paper.

Then

S. Aaronson and A. Arkhipov, Theory Comput. 9
2013
Later among the works it cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Phys. Rev. Lett. 117
2016
Later among the works it cites.
T. Morimae, K. Fujii, and H. Nishimura, Phys. Rev. A 95
Original
2017
Closest in time.
X. Gao, S.-T. Wang, and L.-M. Duan, Phys. Rev. Lett. 118
Original
2017
Closest in time.
D. Hangleiter, J. Bermejo-Vega, M. Schwarz, and J. Eisert, , 1 (2017) , arXiv:1706.03786
Original
2017
Closest in time.

Beyond the bibliography

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

Open on alphaXiv

alphaXiv is searching for related work…