Related papers: The stabilizer ground state and applications to qu…
The stabilizer rank of a quantum state $\psi$ is the minimal $r$ such that $\left| \psi \right \rangle = \sum_{j=1}^r c_j \left|\varphi_j \right\rangle$ for $c_j \in \mathbb{C}$ and stabilizer states $\varphi_j$. The running time of several…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
We consider the following task: how for a given quantum state $\rho$ to find a grounded Hamiltonian $H$ satisfying the condition $\mathrm{Tr} H\rho\leq E_0<+\infty$ in such a way that the von Neumann entropy of the Gibbs state $\gamma_H(E)$…
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…
The unavoidable interaction of quantum systems with their environment usually results in the loss of desired quantum resources. Suitably chosen system Hamiltonians, however, can, to some extent, counteract such detrimental decay, giving…
Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a…
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of…
The performance of quantum algorithms for ground-state energy estimation is directly impacted by the quality of the initial state, where quality is traditionally defined in terms of the overlap of the input state with the target state. An…
We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
We consider quantum spin systems defined on finite sets $V$ equipped with a metric. In typical examples, $V$ is a large, but finite subset of Z^d. For finite range Hamiltonians with uniformly bounded interaction terms and a unique, gapped…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
State selective field ionization detection techniques in physics require a specific progression through a complicated atomic state space to optimize state selectivity and overall efficiency. For large principle quantum number n, the…
Neural network quantum states are a promising tool to analyze complex quantum systems given their representative power. It can however be difficult to optimize efficiently and effectively the parameters of this type of ansatz. Here we…
Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents…
The quantum stabilizer formalism became foundational for understanding error correction soon after the realization of the first useful quantum error correction codes. Stabilizers provide a way to describe sets of quantum states which are…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
Efficient methods for the representation and simulation of quantum states and quantum operations are crucial for the optimization of quantum circuits. Decision diagrams (DDs), a well-studied data structure originally used to represent…
Quantum phase estimation is an important routine in many quantum algorithms, particularly for estimating the ground state energy in quantum chemistry simulations. This estimation involves applying powers of a unitary to the ground state,…
We describe an optimized, self-correcting procedure for the Bayesian inference of pure quantum states. By analyzing the history of measurement outcomes at each step, the procedure returns the most likely pure state, as well as the optimal…