Fetching the paper…
Reading the bibliography…
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments.
P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (IEEE Comput. Soc. Press, 1994) p. 124
1994
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, NY, USA, 1996) p. 212
1996
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402
1999
Earlier work this paper cites.
G. Vidal and R. Tarrach, Robustness of entanglement, Phys. Rev. A 59
1999
Earlier work this paper cites.
J. Eisert, K. Jacobs, P. Papadopoulos, and M. B. Plenio, Optimal local implementation of nonlocal quantum gates, Phys. Rev. A 62
2000
Earlier work this paper cites.
D. Collins, N. Linden, and S. Popescu, Nonlocal content of quantum operations, Phys. Rev. A 64
2001
Earlier work this paper cites.
J. I. Cirac, W. Dür, B. Kraus, and M. Lewenstein, Entangling operations and their implementation using a small amount of entanglement, Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
W. Dür and J. I. Cirac, Nonlocal operations: Purification, storage, compression, tomography, and probabilistic implementation, Phys. Rev. A 64
2001
Earlier work this paper cites.
B. Groisman and B. Reznik, Implementing nonlocal gates with nonmaximally entangled states, Phys. Rev. A 71
2005
Earlier work this paper cites.
H. F. Hofmann, How to simulate a universal quantum computer using negative probabilities, J. Phys. A: Math. Theor. 42
2009
Earlier work this paper cites.
J. Sperling and W. Vogel, Erratum: Representation of entanglement by negative quasiprobabilities [Phys. Rev. A 79, 042337 (2009)], Phys. Rev. A 80
2009
Earlier work this paper cites.
B. P. Lanyon, J. D. Whitfield, G. G. Gillett, M. E. Goggin, M. P. Almeida, I. Kassal, J. D. Biamonte, M. Mohseni, B. J. Powell, M. Barbieri, A. Aspuru-Guzik, and A. G. White, Towards quantum chemistry on a quantum computer, Nat. Chem. 2
2010
Earlier work this paper cites.
D. Stahlke and R. B. Griffiths, Entanglement requirements for implementing bipartite unitary operations, Phys. Rev. A 84
2011
Earlier work this paper cites.
A. Soeda, P. S. Turner, and M. Murao, Entanglement cost of implementing controlled-unitary operations, Phys. Rev. Lett. 107
2011
Earlier work this paper cites.
M. H. Devoret and R. J. Schoelkopf, Superconducting circuits for quantum information: An outlook, Science 339
2013
Earlier work this paper cites.
C. Monroe and J. Kim, Scaling the ion trap quantum processor, Science 339
2013
Cited alongside, same era.
2014
Cited alongside, same era.
H. Pashayan, J. J. Wallman, and S. D. Bartlett, Estimating outcome probabilities of quantum circuits using quasiprobabilities, Phys. Rev. Lett. 115
2015
Cited alongside, same era.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature 549
2017
Cited alongside, same era.
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets, Nature 549
2017
Cited alongside, same era.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature 618
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Temme, S. Bravyi, and J. M. Gambetta, Error mitigation for short-depth quantum circuits, Phys. Rev. Lett. 119
2017
Cited alongside, same era.
V. Havlíček, A. D. Córcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, and J. M. Gambetta, Supervised learning with quantum-enhanced feature spaces, Nature 567
2019
Cited alongside, same era.
2019
Cited alongside, same era.
T. Peng, A. W. Harrow, M. Ozols, and X. Wu, Simulating large quantum circuits on a small quantum computer, Phys. Rev. Lett. 125
2020
Cited alongside, same era.
A. Cowtan, S. Dilkes, R. Duncan, W. Simmons, and S. Sivarajah, Phase gadget synthesis for shallow circuits, EPTCS 318
2020
Cited alongside, same era.
B. Nash, V. Gheorghiu, and M. Mosca, Quantum circuit optimizations for nisq architectures, Quantum Sci. Technol. 5
2020
Cited alongside, same era.
M. P. Harrigan, K. J. Sung, M. Neeley, K. J. Satzinger, F. Arute, K. Arya, J. Atalaya, J. C. Bardin, R. Barends, S. Boixo, M. Broughton, B. B. Buckley, D. A. Buell, B. Burkett, N. Bushnell, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, S. Demura, A. Dunsworth, D. Eppens, A. Fowler, B. Foxen, C. Gidney, M. Giustina, R. Graff, S. Habegger, A. Ho, S. Hong, T. Huang, L. B. Ioffe, S. V. Isakov, E. Jeffrey, Z. Jiang, C. Jones, D. Kafri, K. Kechedzhi, J. Kelly, S. Kim, P. V. Klimov, A. N. Korotkov, F. Kostritsa, D. Landhuis, P. Laptev, M. Lindmark, M. Leib, O. Martin, J. M. Martinis, J. R. McClean, M. McEwen, A. Megrant, X. Mi, M. Mohseni, W. Mruczkiewicz, J. Mutus, O. Naaman, C. Neill, F. Neukart, M. Y. Niu, T. E. O’Brien, B. O’Gorman, E. Ostby, A. Petukhov, H. Putterman, C. Quintana, P. Roushan, N. C. Rubin, D. Sank, A. Skolik, V. Smelyanskiy, D. Strain, M. Streif, M. Szalay, A. Vainsencher, T. White, Z. J. Yao, P. Yeh, A. Zalcman, L. Zhou, H. Neven, D. Bacon, E. Lucero, E. Farhi, and R. Babbush, Quantum approximate optimization of non-planar graph problems on a planar superconducting processor, Nat. Phys. 17
2021
Cited alongside, same era.
2023
Closest in time.
A. Lowe, M. Medvidović, A. Hayes, L. J. O’Riordan, T. R. Bromley, J. M. Arrazola, and N. Killoran, Fast quantum circuit cutting with randomized measurements, Quantum 7
2023
Closest in time.
2023
Closest in time.
C. Ufrecht, M. Periyasamy, S. Rietsch, D. D. Scherer, A. Plinge, and C. Mutschler, Cutting multi-control quantum gates with ZX calculus, Quantum 7
2023
Closest in time.
It can be shown that all operations in the virtual teleportation protocol are elements of the extended definition of local operations used in Ref. Piveteau and Sutter 2024 ; Brenner et al. 2023
2023
Closest in time.
S. Gogioso and R. Yeung, Annealing optimisation of mixed ZX phase circuits, in Proceedings 19th International Conference on Quantum Physics and Logic
2023
Closest in time.
C. Piveteau and D. Sutter, Circuit knitting with classical communication, IEEE Trans. Inf. Theory 70
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.