26 citations · 63 across the 15 of their papers we have counts for
5 papers · 2 filters
Faster Quantum Monte Carlo Simulation by Random Compilation
John M. Martyn, Joshua Lin, Neill C. Warrington +2
Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in t…
Trading Imaginary Time for Randomness in Ground State Preparation
Alvan Arulandu, John M. Martyn, Isaac L. Chuang
Imaginary-time evolution (ITE) is a foundational method for ground state preparation on quantum computers. However, because ITE is non-unitary, existing implementations incur a sam…
Polynomial-time exact diagonalization via sparse guided eigenwalks
Zachary E. Chin, Mario Motta, Javier Robledo Moreno +3
Computing quantum ground states is generically difficult, but additional structure can sometimes allow diagonalization to be recast as a more feasible problem. For example, when th…
Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure
AJ Davenport, John Blue, Isaac Chuang
Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automor…
Full Extractors for Logical Processing in Hypergraph Product Codes
John Blue, Zhiyang He, Hengyun Zhou +1
Quantum low-density parity-check (QLDPC) codes are promising candidates for practical low-overhead quantum memories. For large-scale fault-tolerant quantum computation, we further…