Fetching the paper…
Reading the bibliography…
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations.
D. M. Greenberger, M. A. Horne, and A. Zeilinger, “Going beyond Bell’s theorem,” in
1989
Earlier work this paper cites.
G. Vidal and R. Tarrach, “Robustness of entanglement,”
1999
Earlier work this paper cites.
R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler, “RevLib: An online resource for reversible functions and reversible circuits,” in
2008
Earlier work this paper cites.
L. d. Moura and N. Bjørner, “Z3: An efficient SMT solver,” in
2008
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang,
2011
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,”
2014
Earlier work this paper cites.
S. Bravyi, G. Smith, and J. A. Smolin, “Trading classical and quantum computational resources,”
2016
Earlier work this paper cites.
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,”
2017
Earlier work this paper cites.
J. Preskill, “Quantum computing in the NISQ era and beyond,”
2018
Earlier work this paper cites.
A. Zulehner, A. Paler, and R. Wille, “An efficient methodology for mapping quantum circuits to the IBM QX architectures,”
2018
Earlier work this paper cites.
A. Cowtan, S. Dilkes, R. Duncan, A. Krajenbrink, W. Simmons, and S. Sivarajah, “On the qubit routing problem,” 2019
2019
Earlier work this paper cites.
G. Li, Y. Ding, and Y. Xie, “Tackling the qubit mapping problem for nisq-era quantum devices,” in
2019
Earlier work this paper cites.
T. Peng, A. W. Harrow, M. Ozols, and X. Wu, “Simulating large quantum circuits on a small quantum computer,”
2020
Earlier work this paper cites.
T. Ayral, F.-M. Le Régent, Z. Saleem, Y. Alexeev, and M. Suchara, “Quantum divide and compute: Hardware demonstrations and noisy simulations,” in
2020
Cited alongside, same era.
B. Tan and J. Cong, “Optimal layout synthesis for quantum computing,” in
2020
Cited alongside, same era.
K. Mitarai and K. Fujii, “Constructing a virtual two-qubit gate by sampling single-qubit operations,”
2021
Cited alongside, same era.
——, “Overhead for simulating a non-local channel with local channels by quasiprobability sampling,”
2021
Cited alongside, same era.
W. Tang, T. Tomesh, M. Suchara, J. Larson, and M. Martonosi, “CutQC: using small quantum computers for large quantum circuit evaluations,” in
2021
Cited alongside, same era.
IBM, “Bringing the full power of dynamic circuits to qiskit runtime,” https://research.ibm.com/blog/quantum-dynamic-circuits, 2022
2022
Later among the works it cites.
F. Hua, Y. Jin, Y. Chen, J. Lapeyre, A. Javadi-Abhari, and E. Z. Zhang, “Exploiting qubit reuse through mid-circuit measurement and reset,” 2022
2022
Later among the works it cites.
Google Quantum AI, “Quantum Computer Datasheet,” https://quantumai.google/hardware/datasheet/weber.pdf, 2022
2022
Later among the works it cites.
IBM, “IBM Quantum Experience,” https://quantum-computing.ibm.com/, 2022
2022
Later among the works it cites.
A. tA-v et al., “Qiskit: An open-source framework for quantum computing,” www.qiskit.org, 2022
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Ayral, F.-M. L. Régent, Z. Saleem, Y. Alexeev, and M. Suchara, “Quantum divide and compute: exploring the effect of different noise sources,”
2021
Cited alongside, same era.
D. Maslov, “Reversible logic synthesis benchmarks,”
2021
Cited alongside, same era.
S. Hillmich, A. Zulehner, and R. Wille, “Exploiting quantum teleportation in quantum circuit mapping,” in
2021
Cited alongside, same era.
S. Brandhofer, H. P. Büchler, and I. Polian, “Optimal mapping for near-term quantum architectures based on Rydberg atoms,” in
2021
Cited alongside, same era.
S. Bravyi, O. Dial, J. M. Gambetta, D. Gil, and Z. Nazario, “The future of quantum computing with superconducting qubits,”
2022
Cited alongside, same era.
C. Piveteau and D. Sutter, “Circuit knitting with classical communication,” 2022
2022
Cited alongside, same era.
A. Eddins, M. Motta, T. P. Gujarati, S. Bravyi, A. Mezzacapo, C. Hadfield, and S. Sheldon, “Doubling the size of quantum simulators by entanglement forging,”
2022
Cited alongside, same era.
2022
Later among the works it cites.
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,”
2023
Closest in time.
L. Brenner, C. Piveteau, and D. Sutter, “Optimal wire cutting with classical communication,”
2023
Closest in time.
E. Pednault, “An alternative approach to optimal wire cutting without ancilla qubits,”
2023
Closest in time.
H. Harada, K. Wada, and N. Yamamoto, “Optimal parallel wire cutting without ancilla qubits,”
2023
Closest in time.
S. Brandhofer, I. Polian, and K. Krsulich, “Optimal qubit reuse for near-term quantum computers,” in
2023
Closest in time.