Built on

A. Alexandru, P. F. Bedaque, H. Lamm, and S. Lawrence (NuQS), Phys. Rev. Lett. 123
Original
1903
Earlier work this paper cites.
H. Lamm, S. Lawrence, and Y. Yamauchi (NuQS), Phys. Rev. D 100
Original
1903
Earlier work this paper cites.
H. Singh and S. Chandrasekharan, Phys. Rev. D 100
Original
1905
Earlier work this paper cites.
A. Jena, S. Genin, and M. Mosca, arXiv e-prints , arXiv:1907.07859 (2019), arXiv:1907.07859 [quant-ph]
Original
1907
Earlier work this paper cites.
V. Verteletskyi, T.-C. Yen, and A. F. Izmaylov, J. Chem. Phys. 152
Original
1907
Earlier work this paper cites.
P. Gokhale, O. Angiuli, Y. Ding, K. Gui, T. Tomesh, M. Suchara, M. Martonosi, and F. T. Chong, arXiv e-prints , arXiv:1907.13623 (2019), arXiv:1907.13623 [quant-ph]
Original
1907
Earlier work this paper cites.
N. Klco, J. R. Stryker, and M. J. Savage, Phys. Rev. D 101
Original
1908
Earlier work this paper cites.
O. Crawford, B. van Straaten, D. Wang, T. Parks, E. Campbell, and S. Brierley, arXiv e-prints , arXiv:1908.06942 (2019), arXiv:1908.06942 [quant-ph]
Original
1908
Earlier work this paper cites.
H. Singh, Phys. Rev. D 105
Original
1911
Earlier work this paper cites.
I. Raychowdhury and J. R. Stryker, Phys. Rev. D 101
Original
1912
Earlier work this paper cites.
A. Tranter, P. J. Love, F. Mintert, N. Wiebe, and P. V. Coveney, Entropy 21
Original
1912
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department , edited by R. E. Miller, J. W. Thatcher, and J. D. Bohlinger (Springer US, Boston, MA, 1972) pp. 85–103
1972
Earlier work this paper cites.
N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem , Tech. Rep. 388 (Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group, 1976)
1976
Earlier work this paper cites.
B. Bollobás, “Colouring,” in Graph Theory: An Introductory Course (Springer New York, New York, NY, 1979) pp. 88–102
1979
Earlier work this paper cites.
D. Brélaz, Commun. ACM 22
1979
Earlier work this paper cites.
D. Horn, Physics Letters B 100
1981
Earlier work this paper cites.

Similar

T. F. Coleman and J. J. Moré, SIAM Journal on Numerical Analysis 20
1983
Cited alongside, same era.
P. Orland and D. Rohrlich, Nucl. Phys. B 338
1990
Cited alongside, same era.
S. S. Bullock and I. L. Markov, arXiv e-prints , quant-ph/0303039 (2003), arXiv:quant-ph/0303039 [quant-ph]
2003
Cited alongside, same era.
S. Aaronson and D. Gottesman, Phys. Rev. A 70
2004
Cited alongside, same era.
R. van Bevern and V. A. Slugina, arXiv e-prints , arXiv:2004.02437 (2020), arXiv:2004.02437 [cs.DS]
Original
2004
Cited alongside, same era.
M. Mathur, J. Phys. A 38
2005
Cited alongside, same era.

Then

E. Zohar, A. Farace, B. Reznik, and J. I. Cirac, Phys. Rev. A95
Original
2017
Later among the works it cites.
J. Bender, E. Zohar, A. Farace, and J. I. Cirac, New J. Phys. 20
Original
2018
Later among the works it cites.
A. Tranter, P. J. Love, F. Mintert, and P. V. Coveney, arXiv e-prints , arXiv:1812.02233 (2018), arXiv:1812.02233 [quant-ph]
Original
2018
Later among the works it cites.
N. Klco, E. F. Dumitrescu, A. J. McCaskey, T. D. Morris, R. C. Pooser, M. Sanz, E. Solano, P. Lougovski, and M. J. Savage, Phys. Rev. A 98
2018
Later among the works it cites.
D. Banerjee, F. J. Jiang, T. Z. Olesen, P. Orland, and U. J. Wiese, Phys. Rev. B 97
Original

Beyond the bibliography

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

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2022

How many quantum gates do gauge theories require?

Murairi, Edison M., Cervia, Michael J., Kumar, Hersh et al.

Understand

We discuss the implementation of lattice gauge theories on digital quantum computers, focusing primarily on the number of quantum gates required to simulate their time evolution.

We find that to compile quantum circuits, using available state-of-the-art methods with our own augmentations, the cost of a single time step of an elementary plaquette is beyond what is reasonably practical in the current era of quantum hardware.
However, we observe that such costs are highly sensitive to the truncation scheme used to derive different Hamiltonian formulations of non-Abelian gauge theories, emphasizing the need for low-dimensional truncations of such models in the same universality class as the desired theories.

Built on

A. Alexandru, P. F. Bedaque, H. Lamm, and S. Lawrence (NuQS), Phys. Rev. Lett. 123
Original
1903
Earlier work this paper cites.
H. Lamm, S. Lawrence, and Y. Yamauchi (NuQS), Phys. Rev. D 100
Original
1903
Earlier work this paper cites.
H. Singh and S. Chandrasekharan, Phys. Rev. D 100
Original
1905
Earlier work this paper cites.
A. Jena, S. Genin, and M. Mosca, arXiv e-prints , arXiv:1907.07859 (2019), arXiv:1907.07859 [quant-ph]
Original
1907
Earlier work this paper cites.
V. Verteletskyi, T.-C. Yen, and A. F. Izmaylov, J. Chem. Phys. 152
Original
1907
Earlier work this paper cites.
P. Gokhale, O. Angiuli, Y. Ding, K. Gui, T. Tomesh, M. Suchara, M. Martonosi, and F. T. Chong, arXiv e-prints , arXiv:1907.13623 (2019), arXiv:1907.13623 [quant-ph]
Original
1907
Earlier work this paper cites.
N. Klco, J. R. Stryker, and M. J. Savage, Phys. Rev. D 101
Original
1908
Earlier work this paper cites.
O. Crawford, B. van Straaten, D. Wang, T. Parks, E. Campbell, and S. Brierley, arXiv e-prints , arXiv:1908.06942 (2019), arXiv:1908.06942 [quant-ph]
Original
1908
Earlier work this paper cites.
H. Singh, Phys. Rev. D 105
Original
1911
Earlier work this paper cites.
I. Raychowdhury and J. R. Stryker, Phys. Rev. D 101
Original
1912
Earlier work this paper cites.
A. Tranter, P. J. Love, F. Mintert, N. Wiebe, and P. V. Coveney, Entropy 21
Original
1912
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department , edited by R. E. Miller, J. W. Thatcher, and J. D. Bohlinger (Springer US, Boston, MA, 1972) pp. 85–103
1972
Earlier work this paper cites.
N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem , Tech. Rep. 388 (Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group, 1976)
1976
Earlier work this paper cites.
B. Bollobás, “Colouring,” in Graph Theory: An Introductory Course (Springer New York, New York, NY, 1979) pp. 88–102
1979
Earlier work this paper cites.
D. Brélaz, Commun. ACM 22
1979
Earlier work this paper cites.
D. Horn, Physics Letters B 100
1981
Earlier work this paper cites.

Similar

T. F. Coleman and J. J. Moré, SIAM Journal on Numerical Analysis 20
1983
Cited alongside, same era.
P. Orland and D. Rohrlich, Nucl. Phys. B 338
1990
Cited alongside, same era.
S. S. Bullock and I. L. Markov, arXiv e-prints , quant-ph/0303039 (2003), arXiv:quant-ph/0303039 [quant-ph]
2003
Cited alongside, same era.
S. Aaronson and D. Gottesman, Phys. Rev. A 70
2004
Cited alongside, same era.
R. van Bevern and V. A. Slugina, arXiv e-prints , arXiv:2004.02437 (2020), arXiv:2004.02437 [cs.DS]
Original
2004
Cited alongside, same era.
M. Mathur, J. Phys. A 38
2005
Cited alongside, same era.

Then

E. Zohar, A. Farace, B. Reznik, and J. I. Cirac, Phys. Rev. A95
Original
2017
Later among the works it cites.
J. Bender, E. Zohar, A. Farace, and J. I. Cirac, New J. Phys. 20
Original
2018
Later among the works it cites.
A. Tranter, P. J. Love, F. Mintert, and P. V. Coveney, arXiv e-prints , arXiv:1812.02233 (2018), arXiv:1812.02233 [quant-ph]
Original
2018
Later among the works it cites.
N. Klco, E. F. Dumitrescu, A. J. McCaskey, T. D. Morris, R. C. Pooser, M. Sanz, E. Solano, P. Lougovski, and M. J. Savage, Phys. Rev. A 98
2018
Later among the works it cites.
D. Banerjee, F. J. Jiang, T. Z. Olesen, P. Orland, and U. J. Wiese, Phys. Rev. B 97
Original

Beyond the bibliography

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

Open on alphaXiv

alphaXiv is searching for related work…

T. Byrnes and Y. Yamamoto, Phys. Rev. A 73

2006

Cited alongside, same era.

D. Maslov, G. W. Dueck, D. M. Miller, and C. Negrevergne, arXiv e-prints , quant-ph/0604001 (2006), arXiv:quant-ph/0604001 [quant-ph]

2006

Cited alongside, same era.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. (Cambridge University Press, USA, 2011)

2011

Cited alongside, same era.

M. T. Goodrich, R. Tamassia, and D. M. Mount, Data structures and algorithms in C++ (John Wiley & Sons, 2011)

2011

Cited alongside, same era.

E. J. Gustafson and H. Lamm, Phys. Rev. D 103

Original

2011

Cited alongside, same era.

T. Bhattacharya, A. J. Buser, S. Chandrasekharan, R. Gupta, and H. Singh, Phys. Rev. Lett. 126

Original

2012

Cited alongside, same era.

2018