Related papers: On the Constant Depth Implementation of Pauli Expo…
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
We observe that multi-body interactions, unlike two-body interactions, can implement any unitary operation on an encoded system in such a way that the evolution is uninterrupted by noise that the encoding is designed to protect against.…
Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. Any quantum circuit written in terms of the Clifford+$T$ gate set and having $t$ $T$ gates can be compiled into a…
The surface code is a promising candidate for fault-tolerant quantum computation and has been implemented in many quantum hardware platforms. In this work, we propose a new non-local unitary circuit to encode a surface code state based on a…
A quantum system interacts with its environment, if ever so slightly, no matter how much care is put into isolating it. As a consequence, quantum bits (qubits) undergo errors, putting dauntingly difficult constraints on the hardware…
Atom loss is a major error source in neutral-atom quantum computers, accounting for over 40% of the total physical errors in recent experiments. Its nonlinear and correlated nature poses significant challenges: current syndrome extraction…
We introduce a Pauli-measurement-based algorithm to certify the Schmidt number of $n$-qubit pure states. Our protocol achieves an average-case sample complexity of $\caO(\mathrm{poly}(n)\chi^2)$, a substantial improvement over the $\caO(2^n…
We develop a novel cluster expansion for finite-spin lattice systems subject to multi-body quantum -- and, in particular, classical -- interactions. Our approach is based on the use of ``decoupling parameters", advocated by Park [34], which…
Series for the Wilson functions of an ``environmentally friendly'' renormalization group are computed to two loops, for an $O(N)$ vector model, in terms of the ``floating coupling'', and resummed by the Pad\'e method to yield crossover…
We present Quantum Depth Compression (QDC), a general compilation framework that utilizes dynamic circuits to reduce arbitrary quantum circuits to depth linear in the number of non-Clifford gates and to grid connectivity without the need…
We develop a most likely error Pauli error decoding algorithm for stabiliser codes based on general purpose integer optimisation. Using this decoder we analyse the performance of holographic codes against Pauli errors and find numerical…
We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…
The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…
Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity…
Dynamical decoupling is a coherent control technique where the intrinsic and extrinsic couplings of a quantum system are effectively averaged out by application of specially designed driving fields (refocusing pulse sequences). This entails…
All indecomposable finite-dimensional representations of the homogeneous Galilei group which when restricted to the rotation subgroup are decomposed to spin 0, 1/2 and 1 representations are constructed and classified. These representations…
We investigate properties of exponential operators preserving the particle number using combinatorial methods developed in order to solve the boson normal ordering problem. In particular, we apply generalized Dobinski relations and methods…
We introduce flexible high-fidelity passband (PB) composite pulse sequences constructed by concatenation of recently derived arbitrarily large and arbitrarily accurate broadband $\mathcal{B}$ and narrowband $\mathcal{N}$ composite…
We consider realistic, multi-parameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli…
Transformations which convert between Fermionic modes and qubit operations have become a ubiquitous tool in quantum algorithms for simulating systems. Similarly, collections of Pauli operators might be obtained from solutions of non-local…