Could quantum hardware run a simulation?

In principle yes, as a batch architecture, but with an advantage only if more than one timestep’s worth of state fits in qubit memory. The ideas here are the ones on this blog most likely to change with future advancements in quantum computing.

Quantum hardware seems to naturally fit the batch simulation architecture in the same way that specialised classical hardware does.

In order to utilise this hardware within a given batch evaluation, one would need to:

Note also that the no-cloning theorem means we cannot simply copy the qubits which have run the quantum gates; the circuit must run separately for each simulation trajectory.

Therefore, you only get a quantum advantage if you can store more than one timestep worth of simulation next state values in qubit memory.

Otherwise, if you only effectively have one instantaneous timestep of qubit memory to use, the processing time will likely be dominated by I/O writing to and from the qubits during the simulation. This is also known as the quantum I/O bottleneck.

References and further reading

Aaronson, Scott. 2015. “Read the Fine Print.” Nature Physics 11 (4): 291–93. https://doi.org/10.1038/nphys3272.
Arute, Frank et al. 2019. “Quantum Supremacy Using a Programmable Superconducting Processor.” Nature 574 (7779): 505–10. https://doi.org/10.1038/s41586-019-1666-5.
Feynman, Richard P. 1982. “Simulating Physics with Computers.” International Journal of Theoretical Physics 21 (6–7): 467–88. https://doi.org/10.1007/BF02650179.
Hardwick, Robert J. 2026. “What is a batch simulation architecture?” umbralcalculations, November. https://umbralcalc.github.io/posts/what_is_a_batch_simulation_architecture.html.
Lloyd, Seth. 1996. “Universal Quantum Simulators.” Science 273 (5278): 1073–78. https://doi.org/10.1126/science.273.5278.1073.
Nielsen, Michael A., and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information. 10th Anniversary. Cambridge University Press.
Preskill, John. 2018. “Quantum Computing in the NISQ Era and Beyond.” Quantum 2: 79. https://doi.org/10.22331/q-2018-08-06-79.
Reppel, Ian. 2023. “The I/O Bottleneck in Quantum Computing.” https://ianreppel.org/io-bottleneck-in-quantum-computing/.
Wikipedia contributors. n.d.-a. “Ancilla Bit.” Wikipedia. https://en.wikipedia.org/wiki/Ancilla_bit.
Wikipedia contributors. n.d.-b. “No-Cloning Theorem.” Wikipedia. https://en.wikipedia.org/wiki/No-cloning_theorem.
Wikipedia contributors. n.d.-c. “Quantum Supremacy.” Wikipedia. https://en.wikipedia.org/wiki/Quantum_supremacy.
Wikipedia contributors. n.d.-d. “Qubit.” Wikipedia. https://en.wikipedia.org/wiki/Qubit.