6 citations · 14 across the 11 of their papers we have counts for
10 papers · 1 filter
Gap-Priced -States: Dynamic Post-Selection and Budget-Aware Factory Provisioning
Maxwell Poster, Sayam Sethi, Steven Hofmeyr +3
Magic -state preparation dominates the cost of fault-tolerant quantum computation on surface codes, yet cultivation and distillation are typically provisioned statically…
TopoLS: Lattice Surgery Compilation via Topological Program Transformations
Junyu Zhou, Yuhao Liu, Ethan Decker +5
Lattice surgery is a leading approach for implementing fault-tolerant logical operations in surface code quantum computing, but compiling efficient lattice surgery layouts remains…
F2: Offline Reinforcement Learning for Hamiltonian Simulation via Free-Fermionic Subroutine Compilation
Ethan Decker, Christopher Watson, Junyu Zhou +5
Compiling shallow and accurate quantum circuits for Hamiltonian simulation remains challenging due to hardware constraints and the combinatorial complexity of minimizing gate count…
QTurbo: A Robust and Efficient Compiler for Analog Quantum Simulation
Junyu Zhou, Yuhao Liu, Shize Che +5
Analog quantum simulation leverages native hardware dynamics to emulate complex quantum systems with great efficiency by bypassing the quantum circuit abstraction. However, convent…
Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization
Ethan Decker, Lucas Goetz, Evan McKinney +9
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing…
Verifying Fault-Tolerance of Quantum Error Correction Codes
Kean Chen, Yuhao Liu, Wang Fang +5
Quantum computers have advanced rapidly in qubit count and gate fidelity. However, large-scale fault-tolerant quantum computing still relies on quantum error correction code (QECC)…
HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
Yuhao Liu, Kevin Yao, Jonathan Hong +5
This paper introduces the Hamiltonian-Adaptive Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. In the simulation of…
MarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum Simulation
Xiuqi Cao, Junyu Zhou, Yuhao Liu +2
Quantum simulation, fundamental in quantum algorithm design, extends far beyond its foundational roots, powering diverse quantum computing applications. However, optimizing the com…
Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
Yuhao Liu, Shize Che, Junyu Zhou +2
This paper introduces Fermihedral, a compiler framework focusing on discovering the optimal Fermion-to-qubit encoding for targeted Fermionic Hamiltonians. Fermion-to-qubit encoding…
Bosehedral: Compiler Optimization for Bosonic Quantum Computing
Junyu Zhou, Yuhao Liu, Yunong Shi +2
Bosonic quantum computing, based on the infinite-dimensional qumodes, has shown promise for various practical applications that are classically hard. However, the lack of compiler…