Related papers: On the Constant Depth Implementation of Pauli Expo…
In this paper, we strengthen the connection between qubit-based quantum circuits and photonic quantum computation. Within the framework of circuit-based quantum computation, the sum-over-paths interpretation of quantum probability…
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing…
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli…
A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=\lceil \log_2N\rceil$-qubit state. It has been proven that any algorithm universally implementing this…
We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch…
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…
Simulating real-time quantum dynamics in interacting spin systems is a fundamental challenge, where exact diagonalization suffers from exponential Hilbert-space growth and tensor-network methods face entanglement barriers. Recently,…
Let $J$ be a Jacobi operator on $\ell^2\left(\mathbb{Z}\right)$. We prove an eigenfunction expansion theorem for the singular part of $J$ using subordinate solutions to the eigenvalue equation. We exploit this theorem in order to show that…
We consider an n-qubit quantum system with a Hamiltonian, defined by an expansion in the Pauli basis, and propose a new algorithm for classical computing the exponential of the Hamiltonian. The algorithm is based on the representation of…
Decoding a quantum error correction code is generally NP-hard, but corrections must be applied at a high frequency to suppress noise successfully. Matchable codes, like the surface code, exhibit a special structure that makes it possible to…
The Wilsonian renormalisation group is applied to a system of two nonrelativistic particles interacting via short-range forces and coupled to an external EM field. By demanding that a fully off-shell one-particle-irreducible 5-point…
Transmission Electron Microscopy enables high-resolution imaging of materials, but the resulting images are difficult to interpret directly. One way to address this is exit wave reconstruction, i.e., the recovery of the complex-valued…
Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps…
We establish an ideal-theoretic rigidity principle for quadratic distance images over integer residue rings. Specifically, we prove that near-extremal collapse of the distance set in $\mathbb{Z}_n^d$ forces strong algebraic structure…
We prove that random quantum circuits on any geometry, including a 1D line, can form approximate unitary designs over $n$ qubits in $\log n$ depth. In a similar manner, we construct pseudorandom unitaries (PRUs) in 1D circuits in…
In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The…
Following the idea of Refs.[1,2], the double-copy-like decomposition of exchanged internal states in the world-line limit of one-loop string amplitudes is systematically formulated and generalized to both bosonic and heterotic string…
We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+$T$ basis, that minimize the number of phase-rotation gates in the synthesized approximation circuit.…
We introduce homological measurement, a framework for measuring the logical Pauli operators encoded in CSS stabilizer codes. The framework is based on the algebraic description of such codes as chain complexes. Protocols such as lattice…
Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherent errors (systematic rotations) on physical…