6 papers
Randomized Subsystem Descent for Fermion-to-Qubit Mapping
Gengzhi Yang, Di Wu, Haizhao Yang +2
We propose a versatile and efficient algorithmic framework for optimizing fermion-to-qubit mappings by generalizing the idea of randomized block coordinate descent. Our greedy appr…
Efficient Sparse State Preparation via Quantum Walks
Alvin Gonzales, Rebekah Herrman, Colin Campbell +4
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which…
Extrapolating Pauli Checks for Expectation Value Estimation on Noisy Quantum Devices
Quinn Langfitt, Ji Liu, Benchen Huang +4
Pauli Check Sandwiching (PCS) is an error detection scheme that protects quantum circuits by inserting pairs of parity checks and discarding runs that signal errors. However, each…
QuantEM: The quantum error management compiler
Ji Liu, Quinn Langfitt, Mingyoung Jessica Jeng +7
As quantum computing advances toward fault-tolerant architectures, quantum error detection (QED) has emerged as a practical and scalable intermediate strategy in the transition fro…
QuCLEAR: Clifford Extraction and Absorption for Quantum Circuit Optimization
Ji Liu, Alvin Gonzales, Benchen Huang +2
Quantum computing carries significant potential for addressing practical problems. However, currently available quantum devices suffer from noisy quantum gates, which degrade the f…
Dynamic Resource Allocation with Quantum Error Detection
Quinn Langfitt, Alvin Gonzales, Joshua Gao +4
Quantum processing units (QPUs) are highly heterogeneous in terms of physical qubit performance. To add even more complexity, drift in quantum noise landscapes has been well-docume…