Related papers: Spin-$s$ $U(1)$-eigenstate preparation
The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…
In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles…
We study the ability to implement unitary maps on states of the $I=9/2$ nuclear spin in \textsuperscript{87}Sr, a $d=10$ dimensional (qudecimal) Hilbert space, using quantum optimal control. Through a combination of nuclear spin-resonance…
Quantum annealing offers a promising strategy for solving complex optimization problems by encoding the solution into the ground state of a problem Hamiltonian. While most implementations rely on spin-$1/2$ systems, we explore the…
Solving for quantum ground states is important for understanding the properties of quantum many-body systems, and quantum computers are potentially well-suited for solving for quantum ground states. Recent work has presented a nearly…
We discuss ground state factorization schemes in spin $S$ arrays with general $XYZ$ couplings under general magnetic fields, not necessarily uniform or transverse. It is first shown that given arbitrary spin alignment directions at each…
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body…
To reconstruct a mixed or pure quantum state of a spin s is possible through coherent states: its density matrix is fixed by the probabilities to measure the value s along 4s(s+1) appropriately chosen directions in space. Thus, after…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
Quantum simulation of complex quantum systems and their properties often requires the ability to prepare initial states in an eigenstate of the Hamiltonian to be simulated. In addition, to compute the eigenvalues of a Hamiltonian is in…
Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly…
For donor nuclear spins in silicon, we show how to deterministically prepare various symmetric and asymmetric Dicke states which span a complete basis of the many-body Hilbert space. The state preparation is realized by cooperative pumping…
We propose quantum-selected configuration interaction (QSCI), a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an…
In this paper we propose the recursive stochastic state selection method, an extension of the recently developed stochastic state selection method in Monte Carlo calculations for quantum spin systems. In this recursive method we use…
Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system. In contrast to conventional simulation, which experiences an exponential increase in computational complexity,…
We derive a general method for determining the necessary and sufficient conditions for exact factorization $|\Psi\rangle=\otimes_p |\psi_p\rangle$ of an eigenstate of a many-body Hamiltonian $H$, based on the quantum covariance matrix of…
A protocol is discussed for preparing a spin chain in a generic many-body state in the asymptotic limit of tailored non-unitary dynamics. The dynamics require the spectral resolution of the target state, optimized coherent pulses,…
Spin chains can realise perfect quantum state transfer between the two ends via judicious choice of coupling strengths. In this paper, we study what other states can be created by engineering a spin chain. We conclude that, up to local…
Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological…
In view of the numerous examples in the literature it is attempted to outline a theory of Heisenberg spin systems possessing dimerized ground states (``DGS systems") which comprises all known examples. Whereas classical DGS systems can be…