Related papers: Arbitrary state creation via controlled measuremen…
We discuss how to build some partially entangled states of $n$ two-state quantum systems (qubits). The optimal partially entangled state with a high degree of symmetry is considered to be useful for overcoming a shot noise limit of Ramsey…
Just as any state of a single qubit or 2-level system can be obtained from any other state by a rotation operator parametrized by three real Euler angles, we show how any state of an n-qubit or 2^n-level system can be obtained from any…
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,…
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
It is not a general opinion that that a quantum system could be purified into a target eigenstate via repeated measurements on a coupled qubit rather than direct transitions in the Hamiltonian. The projective measurement on the ancillary…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gates. Reducing the number of CNOT gates can lead to more…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
We construct a quantum algorithm that creates the Laughlin state for an arbitrary number of particles $n$ in the case of filling fraction one. This quantum circuit is efficient since it only uses $n(n-1)/2$ local qudit gates and its depth…
Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we consider the Grover-Rudolph algorithm, which has recently…
We present a detailed account of quantum state estimation by joint maximization of the likelihood and the entropy. After establishing the algorithms for both perfect and imperfect measurements, we apply the procedure to data from simulated…
We present a new algorithm for reducing an arbitrary unitary matrix into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of…
In this work, we report on a novel quantum state reconstruction process based on the disentanglement algorithm. Using variational quantum circuits, we disentangle the quantum state to a product of computational zero states. Inverse…
We show that probabilities of results of all possible measurements performing on a quantum system depend on the system's state only through its density matrix. Therefore all experimentally available information about the state contains in…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. In particular, we focus on superconducting platforms and consider a network of qubits -- encoded in the states of artificial atoms…
Due to the exponential complexity of the resources required by quantum state tomography (QST), people are interested in approaches towards identifying quantum states which require less effort and time. In this paper, we provide a tailored…
We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not…
Quantum state exclusion is the task of determining which states from a given set a system was not prepared in. We provide a complete solution to optimal quantum state exclusion for arbitrary sets of pure states generated by finite groups,…