Related papers: Adaptive constant-depth circuits for manipulating …
Graphs are topological spaces that include broader objects than discretized manifolds, making them interesting playgrounds for the study of quantum phases not realized by symmetry breaking. In particular they are known to support anyons of…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
For circuit-based quantum computation, experimental implementation of universal set of quantum logic gates with high-fidelity and strong robustness is essential and central. Quantum gates induced by geometric phases, which depend only on…
Long-range entanglement--the backbone of topologically ordered states--cannot be created in finite time using local unitary circuits, or equivalently, adiabatic state preparation. Recently it has come to light that single-site measurements…
We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-qubit measurements in any basis. Our results apply to…
Noise is both ubiquitous and generally deleterious in settings where precision is required. This is especially true in the quantum technology sector where system utility typically decays rapidly under its influence. Understanding the noise…
We solve the nuclear two-body and three-body bound states via quantum simulations of pionless effective field theory on a lattice in position space. While the employed lattice remains small, the usage of local Hamiltonians including two-…
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…
Dual-unitary quantum circuits can be used to construct 1+1 dimensional lattice models for which dynamical correlations of local observables can be explicitly calculated. We show how to analytically construct classes of dual-unitary circuits…
Adaptive quantum circuits-where a quantum many-body state is controlled using measurements and conditional unitary operations-are a powerful paradigm for state preparation and quantum error correction tasks. They can support two types of…
We propose a dual-architecture quantum simulation framework for modeling morphisms and stability conditions in the bounded derived category $\mathbf{D}^b(\mathrm{Coh}(X))$, with applications to D-brane physics on K\"ahler and non-K\"ahler…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
In this paper, we design quantum circuits for the exponential of scaled $n$-qubit Pauli strings using single-qubit rotation gates, Hadamard gate, and CNOT gates. A key result we derive is that any two Pauli-string operators composed of…
Adaptive measurements were recently shown to significantly improve the performance of quantum state tomography. Utilizing information about the system for the on-line choice of optimal measurements allows to reach the ultimate bounds of…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
We consider a theory of superselection sectors for infinite quantum spin systems, describing charges that can be approximately localized in cone-like regions. The primary examples we have in mind are the anyons (or charges) in topologically…
Measuring quantum observables by grouping terms that can be rotated to sums of only products of Pauli $\hat z$ operators (Ising form) is proven to be efficient in near term quantum computing algorithms. This approach requires extra unitary…
Reducing the circuit depth of quantum circuits is a crucial bottleneck to enabling quantum technology. This depth is inversely proportional to the number of available quantum gates that have been synthesised. Moreover, quantum gate…
We develop the general quantum measurement theory of non-Abelian anyons through interference experiments. The paper starts with a terse introduction to the theory of anyon models, focusing on the basic formalism necessary to apply standard…