297 citations · 880 across the 30 of their papers we have counts for
8 papers · 1 filter
Efficient quantum implementation of 2+1 U(1) lattice gauge theories with Gauss law constraints
Christopher Kane, Dorota M. Grabowska, Benjamin Nachman +1
The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentall…
Practical considerations for the preparation of multivariate Gaussian states on quantum computers
Christian W. Bauer, Plato Deliyannis, Marat Freytsis +1
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient du…
Categorizing Readout Error Correlations on Near Term Quantum Computers
Benjamin Nachman, Michael R. Geller
Readout errors are a significant source of noise for near term quantum computers. A variety of methods have been proposed to mitigate these errors using classical post processing.…
Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications
Wonho Jang, Koji Terashi, Masahiko Saito +7
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to ma…
Readout Rebalancing for Near Term Quantum Computers
Rebecca Hicks, Christian W. Bauer, Benjamin Nachman
Readout errors are a significant source of noise for near term intermediate scale quantum computers. Mismeasuring a qubit as a 1 when it should be 0 occurs much less often than mis…
Resource Efficient Zero Noise Extrapolation with Identity Insertions
Andre He, Benjamin Nachman, Wibe A. de Jong +1
In addition to readout errors, two-qubit gate noise is the main challenge for complex quantum algorithms on noisy intermediate-scale quantum (NISQ) computers. These errors are a si…