Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM eBooks

ACM TechBrief: Quantum Computing and Simulation

Simson Garfinkel, Chris Jay Hoofnagle

Published Jul 28, 2022• 2 citations
Publisher
DOI
10.1145/3551664

Related papers

Numerical analysis of boosting scheme for scalable NMR quantum computation

Akira SaiToh, Masahiro Kitagawa

Among initialization schemes for ensemble quantum computation beginning at thermal equilibrium, the scheme proposed by Schulman and Vazirani [in Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99) (ACM Press, New York, 1999), pp. 322--329] is known for the simple quantum circuit to redistribute the biases (polarizations) of qubits and small time complexity. However, our numerical simulation shows that the number of qubits initialized by the scheme is rather smaller than expected from the von Neumann entropy because of an increase in the sum of the binary entropies of individual qubits, which indicates a growth in the total classical correlation. This result---namely, that there is such a significant growth in the total binary entropy---disagrees with that of their analysis.

arXiv:quant-ph/0305097•Physical Review A•Feb 8, 2005•5 citations

Quantum Computing Overview

Osama Babakhel, Mujahid Tabassum, Tripti Sharma

Information systems engineering and management•Jan 1, 2025•0 citations

An overview of quantum computing

ARTUR K. EKERT, Chiara Macchiavello

•Jan 1, 1998•7 citations

Exploring the promise of quantum computing

Leah Hoffmann

ACM Computing Prize recipient Scott Aaronson discusses his work in quantum complexity.

Communications of the ACM•Nov 19, 2021•1 citation

Quantum Computing - An Overview

T. R. Govindan

•Apr 16, 2018•0 citations

Classical simulation of noninteracting-fermion quantum circuits

Barbara M. Terhal, David Peter Divincenzo

We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant [in Proceedings of the 33rd ACM Symposium on the Theory of Computing (2001), p. 114] corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof of his result using the language of fermions and extend the result to noninteracting fermions with arbitrary pairwise interactions, where gates can be conditioned on outcomes of complete von Neumann measurements in the computational basis on other fermionic modes in the circuit. This last result is in remarkable contrast with the case of noninteracting bosons where universal quantum computation can be achieved by allowing gates to be conditioned on classical bits [E. Knill, R. Laflamme, and G. Milburn, Nature (London) 409, 46 (2001)].

arXiv:quant-ph/0108010•Physical Review A•Mar 1, 2002•380 citations
Among initialization schemes for ensemble quantum computation beginning at thermal equilibrium, the scheme proposed by Schulman and Vazirani [in Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99) (ACM Press, New York, 1999), pp. 322--329] is known for the simple quantum circuit to redistribute the biases (polarizations) of qubits and small time complexity. However, our numerical simulation shows that the number of qubits initialized by the scheme is rather smaller than expected from the von Neumann entropy because of an increase in the sum of the binary entropies of individual qubits, which indicates a growth in the total classical correlation. This result---namely, that there is such a significant growth in the total binary entropy---disagrees with that of their analysis.
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant [in Proceedings of the 33rd ACM Symposium on the Theory of Computing (2001), p. 114] corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof of his result using the language of fermions and extend the result to noninteracting fermions with arbitrary pairwise interactions, where gates can be conditioned on outcomes of complete von Neumann measurements in the computational basis on other fermionic modes in the circuit. This last result is in remarkable contrast with the case of noninteracting bosons where universal quantum computation can be achieved by allowing gates to be conditioned on classical bits [E. Knill, R. Laflamme, and G. Milburn, Nature (London) 409, 46 (2001)].