Related papers: Abelian Group Quantum Error Correction in Kitaev's…
This paper addresses the issue of correcting type errors in model transformations in realistic scenarios where neither predefined patches nor behavior-safe guards such as test suites are available. Instead of using predefined patches…
We show how nonrelativistic many body techniques can be used to study quantum corrections to the classical limit, in particular of the $SU(2)$ Lipkin Model. We show that the quantum corrections are essentially of two types: unitary and…
This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed.…
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…
This work provides a nonasymptotic error analysis of quantum Krylov algorithms based on real-time evolutions, subject to generic errors in the outputs of the quantum circuits. We prove upper and lower bounds on the resulting ground state…
Testing efficiently whether a finite set with a binary operation over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the…
We provide a new approach to error mitigation for quantum chemistry simulation that uses a Bravyi-Kitaev Superfast encoding to implement a quantum error detecting code within the fermionic encoding. Our construction has low-weight parity…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
Kitaev's quantum double model is a lattice gauge theoretic realization of Dijkgraaf-Witten topological quantum field theory (TQFT), its topologically protected ground state space has broad applications for topological quantum computation…
Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high…
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…
With a Bayesian approach, the linear optics correction algorithm for storage rings is revisited. Starting from the Bayes' theorem, a complete linear optics model is simplified as "likelihood functions" and "prior probability distributions".…
In this paper, we consider the Gauss quadrature formulae corresponding to some modifications of anyone of the four Chebyshev weights, considered by Gautschi and Li in \cite{gauli}. As it is well known, in the case of analytic integrands,…
Quantum error correction was invented to allow for fault-tolerant quantum computation. Systems with topological order turned out to give a natural physical realization of quantum error correcting codes (QECC) in their groundspaces. More…
We design an adaptive finite element method to approximate the solutions of quasi-linear elliptic problems. The algorithm is based on a Ka\v{c}anov iteration and a mesh adaptation step is performed after each linear solve. The method is…
We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
We propose a fault-tolerant quantum error correction architecture consisting of a linear array of emitters and delay lines. In our scheme, a resource state for fault-tolerant quantum computation is generated by letting the emitters interact…
In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result…
The Bethe Ansatz is a method that is used in quantum integrable models in order to solve them explicitly. This method is explained here in a general framework, which applies to 1D quantum spin chains, 2D statistical lattice models (vertex…