Related papers: Preparing projected entangled pair states on a qua…
We describe an experimental scheme of preparing multipartite W class of maximally entangled states between many atomic ensembles. The scheme is based on laser manipulation of atomic ensembles and single-photon detection, and well fits the…
Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices…
In this paper, we explore the construction of Planar Maximally Entangled (PME) states from phase states. PME states form a class of $n$-partite states in which any subset of adjacent particles whose size is less than or equal to half the…
We demonstrate an experimental realization of remote state preparation via the quantum teleportation algorithm, using an entangled photon pair in the polarization degree of freedom as the quantum resource. The input state is encoded on the…
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and…
Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap to the…
Quantum information processing tasks require exotic quantum states as a prerequisite. They are usually prepared with many different methods tailored to the specific resource state. Here we provide a versatile unified state preparation…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We perform quantum simulation on classical and quantum computers and set up a machine learning framework in which we can map out phase diagrams of known and unknown quantum many-body systems in an unsupervised fashion. The classical…
Numerical treatment of two dimensional strongly-correlated systems is both extremely challenging and of fundamental importance. Infinite projected entangled-pair states (PEPS), a class of tensor networks, have demonstrated cutting-edge…
We consider the problem of creating a long-distance entangled state between two stations of a network, where neighboring nodes are connected by noisy quantum channels. We show that any two stations can share an entangled pair if the…
We propose a scheme to unconditionally entangle the internal states of atoms trapped in separate high finesse optical cavities. The scheme uses the technique of quantum reservoir engineering in a cascaded cavity QED setting, and for ideal…
We propose a quantum repeater protocol and architecture that mitigates decoherence of the entangled states by optimizing the quantum memory buffer time. The protocol maximizes the rate of distillable entanglement in the average accessed…
This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to…
A scheme is proposed for preparing delocalised mesoscopic states of the motion of two or more atoms trapped at distantly-separated locations. Generation of entanglement is achieved using interactions in cavity quantum electrodynamics which…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
We find an efficient approach to approximately convert matrix product states (MPSs) into restricted Boltzmann machine wave functions consisting of a multinomial hidden unit through a canonical polyadic (CP) decomposition of the MPSs. This…
We describe a practical and efficient approach to represent physically realistic long-range interactions in two-dimensional tensor network algorithms via projected entangled-pair operators (PEPOs). We express the long-range interaction as a…
Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is…
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to…