Patrick Rall
YOU?
Author Swipe
View article: Tour de gross: A modular quantum computer based on bivariate bicycle codes
Tour de gross: A modular quantum computer based on bivariate bicycle codes Open
We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with distances 12 and 18, we construct explic…
View article: Halving the cost of quantum algorithms with randomization
Halving the cost of quantum algorithms with randomization Open
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized compili…
View article: Lightcone shading for classically accelerated quantum error mitigation
Lightcone shading for classically accelerated quantum error mitigation Open
Quantum error mitigation (QEM) can recover accurate expectation values from a noisy quantum computer by trading off bias for variance, such that an averaged result is more accurate but takes longer to converge. Probabilistic error cancella…
View article: Halving the Cost of Quantum Algorithms with Randomization
Halving the Cost of Quantum Algorithms with Randomization Open
Quantum signal processing (QSP) provides a systematic framework for implementing a polynomial transformation of a linear operator, and unifies nearly all known quantum algorithms. In parallel, recent works have developed randomized compili…
View article: Efficient Long-Range Entanglement Using Dynamic Circuits
Efficient Long-Range Entanglement Using Dynamic Circuits Open
Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by nonunitary, dynamic circuits. The…
View article: Improved QLDPC Surgery: Logical Measurements and Bridging Codes
Improved QLDPC Surgery: Logical Measurements and Bridging Codes Open
In this paper, we introduce the gauge-fixed QLDPC surgery scheme, an improved logical measurement scheme based on the construction of Cohen et al. (Sci. Adv. 8, eabn1717). Our scheme leverages expansion properties of the Tanner graph to su…
View article: Quantum-centric supercomputing for materials science: A perspective on challenges and future directions
Quantum-centric supercomputing for materials science: A perspective on challenges and future directions Open
View article: High-threshold and low-overhead fault-tolerant quantum memory
High-threshold and low-overhead fault-tolerant quantum memory Open
View article: Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis
Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis Open
In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits. We consider models of entanglement-assisted computation where long-range operations are achieved …
View article: Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions Open
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming …
View article: Thermal State Preparation via Rounding Promises
Thermal State Preparation via Rounding Promises Open
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Cru…
View article: Efficient Long-Range Entanglement using Dynamic Circuits
Efficient Long-Range Entanglement using Dynamic Circuits Open
Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by non-unitary, dynamic circuits. Th…
View article: High-threshold and low-overhead fault-tolerant quantum memory
High-threshold and low-overhead fault-tolerant quantum memory Open
Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement circuit, and decoding algorithm. Here we present an end-to-…
View article: Amplitude Estimation from Quantum Signal Processing
Amplitude Estimation from Quantum Signal Processing Open
Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? …
View article: Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis
Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis Open
In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits. We consider models of entanglement-assisted computation where long-range operations are achieved …
View article: Thermal State Preparation via Rounding Promises
Thermal State Preparation via Rounding Promises Open
A promising avenue for the preparation of Gibbs states on a quantum computer is to simulate the physical thermalization process. The Davies generator describes the dynamics of an open quantum system that is in contact with a heat bath. Cru…
View article: Amplitude Estimation from Quantum Signal Processing
Amplitude Estimation from Quantum Signal Processing Open
Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? In th…
View article: Understanding holographic error correction via unique algebras and atomic examples
Understanding holographic error correction via unique algebras and atomic examples Open
View article: Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation
Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation Open
We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of the unitary, and the state must not be measured. Most quantum estim…
View article: Entangled quantum cellular automata, physical complexity, and Goldilocks rules
Entangled quantum cellular automata, physical complexity, and Goldilocks rules Open
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in …
View article: Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude\n Estimation
Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude\n Estimation Open
We consider performing phase estimation under the following conditions: we\nare given only one copy of the input state, the input state does not have to be\nan eigenstate of the unitary, and the state must not be measured. Most quantum\nes…
View article: Entangled quantum cellular automata, physical complexity, and Goldilocks rules
Entangled quantum cellular automata, physical complexity, and Goldilocks rules Open
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in …
View article: Quantum algorithms for estimating physical quantities using block encodings
Quantum algorithms for estimating physical quantities using block encodings Open
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
View article: Quantum Approximate Counting, Simplified
Quantum Approximate Counting, Simplified Open
In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for\napproximate counting. Given a list of $N$ items, $K$ of them marked, their\nalgorithm estimates $K$ to within relative error $\\varepsilon$ by making only\n$O\\…
View article: Quantum Approximate Counting, Simplified
Quantum Approximate Counting, Simplified Open
In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for approximate counting. Given a list of $N$ items, $K$ of them marked, their algorithm estimates $K$ to within relative error $\varepsilon$ by making only $O\left(…
View article: Simulation of qubit quantum circuits via Pauli propagation
Simulation of qubit quantum circuits via Pauli propagation Open
We present novel algorithms to estimate outcomes for qubit quantum circuits.\nNotably, these methods can simulate a Clifford circuit in linear time without\never writing down stabilizer states explicitly. These algorithms outperform\nprevi…
View article: Simulating Quantum Circuits by Shuffling Paulis
Simulating Quantum Circuits by Shuffling Paulis Open
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, th…
View article: Fractal Properties of Magic State Distillation
Fractal Properties of Magic State Distillation Open
Magic state distillation protocols have a complicated non-linear nature. Analysis of protocols is therefore usually restricted to one-parameter families of states, which aids tractability. We show that if we lift this one-parameter restric…
View article: Signed quantum weight enumerators characterize qubit magic state distillation
Signed quantum weight enumerators characterize qubit magic state distillation Open
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magi…