Related papers: Efficient Quantum State Preparation with Walsh Ser…
While the preparation of a general quantum state is challenging, realistic problem instances, such as those encountered in quantum chemistry and quantum machine learning-typically exhibit hierarchical amplitude structures, consisting of a…
Finding the solution to linear systems is at the heart of many applications in science and technology. Over the years a number of algorithms have been proposed to solve this problem on a digital quantum device, yet most of these are too…
Quantum information has been drawing a wealth of research in recent years, shedding light on questions at the heart of quantum mechanics, as well as advancing fields such as complexity theory, cryptography, key distribution, and chemistry.…
A central ingredient in fault-tolerant quantum algorithms is the initialization of a logical state for a given quantum error-correcting code from a set of noisy qubits. A scheme that has demonstrated promising results for small code…
One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory.…
Dissipation has traditionally been considered a hindrance to quantum information processing, but recent studies have shown that it can be harnessed to generate desired quantum states. To be useful for practical applications, the ability to…
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…
The vacuum of the lattice Schwinger model is prepared on up to 100 qubits of IBM's Eagle-processor quantum computers. A new algorithm to prepare the ground state of a gapped translationally-invariant system on a quantum computer is…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency of this process leads to a major bottleneck for the…
Distributed quantum computing offers a promising approach to scaling quantum devices by networking multiple quantum processors. We present a quantum state tomography protocol tailored for distributed quantum computers that avoids assuming…
W states are a valuable resource for various quantum information tasks, and several protocols to generate them have been proposed and implemented. We introduce a quantum repeater protocol to efficiently distribute three-qubit W states over…
Measuring the closest distance between two states is an alternative and significant approach in the resource quantification, which is the core task in the resource theory. Quite limited progress has been made for this approach even in…
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…
The reliable generation of multi-qubit entanglement is a prerequisite for large-scale quantum information technologies. In particular, W states are a valuable resource owing to their resilience under local loss or measurement. Nevertheless,…
Classical simulation of a programmable quantum processor is crucial in identifying the threshold of a quantum advantage. We demonstrate the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge that represent random…
In large quantum systems multipartite entanglement can be found in many inequivalent classes under local operations and classical communication. Preparing states of arbitrary size in different classes is important for performing a wide…
We introduce the concept of selective quantum state tomography or SQST, a tomographic scheme that enables a user to estimate arbitrary elements of an unknown quantum state using a fixed measurement record. We demonstrate how this may be…
Perfect state transfer (PST) through a spin chain can be theoretically obtained via predesigned PST couplings. However, the corresponding experiment on IBM quantum computers demonstrates low transmission success probability (SP) due to…
Quantum State Tomography is the task of determining an unknown quantum state by making measurements on identical copies of the state. Current algorithms are costly both on the experimental front -- requiring vast numbers of measurements --…