Related papers: Deterministic Bethe state preparation
The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|\psi_v\rangle =\sum_{k=0}^{2^n-1}v_k|k\rangle$ from the initial state $|0\rangle^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\ldots,v_{2^n-1})^T\in…
Controlled unitary gates are a basic element in many quantum algorithms. Converting a general unitary $U$ with a known decomposition into its controlled version, controlled-$U$, can introduce a large overhead in terms of the depth of the…
We present a Dicke state preparation scheme which uses global control of $N$ spin qubits: our scheme is based on the standard phase estimation algorithm, which estimates the eigenvalue of a unitary operator. The scheme prepares a Dicke…
We demonstrate a simple technique to prepare and determine the desired internal quantum states in multi-Zeeman-sublevel atoms. By choosing appropriate coupling and pumping laser beams, atoms can be easily prepared in a desired Zeeman…
We find an analytic solution of the Bethe Ansatz equations (BAE) for the special case of a finite XXZ spin chain with free boundary conditions and with a complex surface field which provides for $U_q(sl(2))$ symmetry of the Hamiltonian.…
The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wavefunctions that are relevant in the behavior of the system under study. Hamiltonian symmetries are an important…
We propose a deterministic remote state preparation scheme for photon polarization qubit states, where entanglement, local operations and classical communication are used. By consuming one maximally entangled state and two classical bits,…
In this paper, we reinvestigate remote state preparation by using the prepared non-maximally entangled channel. An innovative remote state preparation protocol is developed for deterministically preparing information encoded in quantum…
The preparation of entangled quantum states is an inherent and indispensable step for the implementation of many quantum information algorithms. Depending on the physical system, there are different ways to control and measure them, which…
We conjecture a new way to construct eigenstates of integrable XXX quantum spin chains with SU(N) symmetry. The states are built by repeatedly acting on the vacuum with a single operator Bgood(u) evaluated at the Bethe roots. Our proposal…
We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n "copy" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
We apply the adaptive variational quantum imaginary time evolution (AVQITE) method to prepare ground states of one-dimensional spin $S=1$ models. We compare different spin-to-qubit encodings (standard binary, Gray, unary, and multiplet)…
Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These…
This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…
In this note, we derive the spectrum of the infinite quantum XXZ spin chain with domain wall boundary conditions. The eigenstates are constructed as limits of Bethe states for the finite XXZ spin chain with quantum sl(2) invariant boundary…
Quantum state preparation (QSP) is a fundamental task in quantum computation to prepare a quantum state for a given classical description of the quantum state. The classical description of an $n$-qubit quantum state may have $\exp(O(n))$…
We show that iteration of a few ( $\sim N^{1/4}$) unitary steps of Grover's algorithm suffices to perfectly prepare a Dicke state of $N$ atoms in a cavity. We also show that a few subsequent Grover steps can be employed to generate GHZ and…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…
We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an $N$-dimensional state in depth $O(\log(N))$ and spacetime allocation (a…