9 papers
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…
Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
Yuan Liu, Shraddha Singh, Kevin C. Smith +11
Quantum computing with discrete variable (DV, qubit) hardware is approaching the large scales necessary for computations beyond the reach of classical computers. However, important…
Parallel Quantum Signal Processing Via Polynomial Factorization
John M. Martyn, Zane M. Rossi, Kevin Z. Cheng +2
Quantum signal processing (QSP) is a methodology for constructing polynomial transformations of a linear operator encoded in a unitary. Applied to an encoding of a state , QSP…