Related papers: Quantum State Preparation via Nested Entanglement
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
Robust quantum computation requires encoding delicate quantum information into degrees of freedom that are hard for the environment to change. Quantum encodings have been demonstrated in many physical systems by observing and correcting…
We present one-shot compression protocols that optimally encode ensembles of $N$ identically prepared mixed states into $O(\log N)$ qubits. In contrast to the case of pure-state ensembles, we find that the number of encoding qubits drops…
Multipartite entanglement is a key resource for quantum computation. It is expected theoretically that entanglement transition may happen for multipartite random quantum states, however, which is still absent experimentally. Here, we report…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it…
It is shown that a state that is factorizable in the Hilbert space corresponding to some choice of degrees of freedom, becomes entangled for a different choice of degrees of freedom. Therefore, entanglement is not a special case but is…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We present applications of the representation theory of Lie groups to the analysis of structure and local unitary classification of Werner states, sometimes called the {\em decoherence-free} states, which are states of $n$ quantum bits left…
A simple scheme to prepare an entanglement between two separated qubits from a given mixed state is proposed. A single qubit (entanglement mediator) is repeatedly made to interact locally and consecutively with the two qubits through…
We study the noncommutative geometrical structures of quantum entangled states. We show that the space of a pure entangled state is a noncommutative space. In particular we show that by rewritten the conifold or the Segre variety we can get…
Using an NMR quantum computer, we experimentally simulate the quantum phase transition of a Heisenberg spin chain. The Hamiltonian is generated by a multiple pulse sequence, the nuclear spin system is prepared in its (pseudo-pure) ground…
Cavity-based large-scale quantum information processing (QIP) needs a large number of qubits and placing all of them in a single cavity quickly runs into many fundamental and practical problems such as the increase of cavity decay rate and…
In this paper, we investigate how to reduce the number of measurement configurations needed for sufficiently precise entanglement quantification. Instead of analytical formulae, we employ artificial neural networks to predict the amount of…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
We present an extension of the Evolving density matrices on Qubits (E$\rho$OQ) framework that enables efficient fault-tolerant preparation of fermionic quantum states. The original method circumvents state preparation by stochastic…
A prerequisite to the successful development of quantum computers and simulators is precise understanding of physical processes occurring therein, which can be achieved by measuring the quantum states they produce. However, the resources…
We introduce a method for analyzing ground state properties of quantum many body systems, based on the characterization of separability and entanglement by single subsystem unitary operations. We apply the method to the study of the ground…