An alternative approach to optimal wire cutting without ancilla qubits

Exact and approximate unitary 2-designs and their application to fidelity estimation

Dankert, C., Cleve, R., Emerson, J. & Livine, E · 2009

Earlier work this paper cites.

The Clifford group forms a unitary 3-design

Webb, Z · 2016

Earlier work this paper cites.

Error mitigation for short-depth quantum circuits

Temme, K., Bravyi, S. & Gambetta, J. M · 2017

Earlier work this paper cites.

Simulating large quantum circuits on a small quantum computer

Peng, T., Harrow, A. W., Ozols, M. & Wu, X · 2020

Earlier work this paper cites.

o ⁡ ( n 3 ) o(n^{3}) Measurement cost for variational quantum eigensolver on molecular hamiltonians

Gokhale, P. et al · 2020

Earlier work this paper cites.

Fundamentals of quantum mechanics in Liouville space

Gyamfi, J. A · 2020

Cited alongside, same era.

Quantum divide and compute: Exploring the effect of different noise sources

Ayral, T., Régent, F.-M. L., Saleem, Z., Alexeev, Y. & Suchara, M · 2021

Cited alongside, same era.

Cutqc: Using small quantum computers for large quantum circuit evaluations

Tang, W., Tomesh, T., Suchara, M., Larson, J. & Martonosi, M · 2021

Cited alongside, same era.

Quantum circuit cutting with maximum-likelihood tomography

Perlin, M. A., Saleem, Z. H., Suchara, M. & Osborn, J. C · 2021

Cited alongside, same era.

A simple method for sampling random Clifford operators

Van Den Berg, E · 2021

Cited alongside, same era.

6-qubit optimal Clifford circuits

Bravyi, S., Latone, J. A. & Maslov, D · 2022

Later among the works it cites.

Optimal wire cutting with classical communication

Original

Brenner, L., Piveteau, C. & Sutter, D · 2023

Closest in time.

Fast quantum circuit cutting with randomized measurements

Lowe, A. et al · 2023

Closest in time.

Optimal parallel wire cutting without ancilla qubits

Original

Harada, H., Wada, K. & Yamamoto, N · 2023

Closest in time.

A00395: Order of complex Clifford group of degree 2 n 2^{n} arising in quantum coding theory

Sloane, N. J. A. & Shor, P · 2023

Closest in time.