Related papers: Logical Resource Estimation for Quantum State Prep…
Quantum computing has made tremendous improvements in both software and hardware that have sparked interest in academia and industry to realize quantum computing applications. To this end, several steps are necessary: The underlying problem…
The ability to prepare states for quantum chemistry is a promising feature of quantum computers, and efficient techniques for chemical state preparation is an active area of research. In this paper, we implement and investigate two methods…
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential…
Reconstructing quantum states is an important task for various emerging quantum technologies. The process of reconstructing the density matrix of a quantum state is known as quantum state tomography. Conventionally, tomography of arbitrary…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using…
In order to implement a quantum computing application, problem instances must be encoded into a quantum circuit and then compiled for a specific platform. The lengthy compilation process is a key bottleneck in this workflow, especially for…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
Quantum state preparation is a central primitive in many quantum algorithms, yet it is generally resource intensive, with efficient constructions known only for structured families of states. This work introduces a method for preparing…
Quantum compilation provides a method to translate quantum algorithms at a high level of abstraction into their implementations as quantum circuits on real hardware. One approach to quantum compiling is to design a parameterised circuit and…
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence…
We introduce an approximate description of an $N$-qubit state, which contains sufficient information to estimate the expectation value of any observable to a precision that is upper bounded by the ratio of a suitably-defined seminorm of the…
A theoretical model of a quantum device which can factorize any number N in two steps i.e. by preparing an input state and performing a measurement is discussed. The analysis reveals that the duration of state preparation and measurement is…
We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls applying $n$ single-qubit arbitrary phase rotations from $4n b+\mathcal{O}(\sqrt{cn b})$ to $2n b+\mathcal{O}(\sqrt{cn…
Real-world applications of computing can be extremely time-sensitive. It would be valuable if we could accelerate such tasks by performing some of the work ahead of time. Motivated by this, we propose a cost model for quantum algorithms…
The preparation of quantum states is one of the most fundamental tasks in quantum computing, and a key primitive in many quantum algorithms. Of particular interest to areas such as quantum simulation and linear-system solvers are sparse…
We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper…
Quantum Phase Estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of…
Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. However, initial state preparation is commonly either neglected entirely, or assumed to be solved by a simple product state like…
Quantum state tomography is a fundamental tool in quantum information processing. It allows us to estimate the state of a quantum system by measuring different observables on many identically prepared copies of the system. This is, in…