Related papers: Stabilizer Approximation
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
By revisiting the path-integral formulation of the Hubbard model, we propose a theoretical approach based on a semiclassical approximation employing an unconventional coherent-state representation. Within this framework, a subset of the…
We extend the concept of probabilistic unambiguous discrimination of quantum states to quantum state estimation. We consider a scenario where the measurement device can output either an estimate of the unknown input state or an inconclusive…
We explore the features of two methods of stabilization, aggregation and supremizer methods, for reduced-order modeling of parametrized optimal control problems. In both methods, the reduced basis spaces are augmented to guarantee…
The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of…
We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known…
Starting from the study of one-dimensional potentials in quantum mechanics having a small distance behavior described by a harmonic oscillator, we extend this way of analysis to models where such a behavior is not generally expected. In…
In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling…
A method is suggested to obtain the quasi exact solution of the Rabi Hamiltonian. It is conceptually simple and can be easily extended to other systems. The analytical expressions are obtained for eigenstates and eigenvalues in terms of…
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been…
It is a known fact that not all controllable systems can be asymptotically stabilized by a continuous static feedback. Several approaches have been developed throughout the last decades, including time-varying, dynamical and even…
We provide a novel approach for characterization of quantum Hamiltonian systems via utilizing a single measurement device. Specifically, we demonstrate how external quantum correlations can be used for Hamiltonian identification tasks. We…
We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schroedinger…
Traditional quantum physics solves ground states for a given Hamiltonian, while quantum information science asks for the existence and construction of certain Hamiltonians for given ground states. In practical situations, one would be…
This is a short review on an interdisciplinary field of quantum information science and statistical mechanics. We first give a pedagogical introduction to the stabilizer formalism, which is an efficient way to describe an important class of…
Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems.…
Stabilizer operations are at the heart of quantum error correction and are typically implemented in software-controlled entangling gates and measurements of groups of qubits. Alternatively, qubits can be designed so that the Hamiltonian…
The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in…
Sampling the stationary points of a complicated potential energy landscape is a challenging problem. Here we introduce a sampling method based on relaxation from stationary points of the highest index of the Hessian matrix. We illustrate…
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum…