Related papers: Algorithmic cooling for resolving state preparatio…
Quantum information processing offers promising advances for a wide range of fields and applications, provided that we can efficiently assess the performance of the control applied in candidate systems. That is, we must be able to determine…
Nature is governed by precise physical laws, which can inspire the discovery of new computer-run simulation algorithms. Thermal states are the most ubiquitous for they are the equilibrium states of matter. Simulating thermal states of…
Pure quantum states play a central role in applications of quantum information, both as initial states for many algorithms and as resources for quantum error correction. Preparation of highly pure states that satisfy the threshold for…
In Ref. [Phys. Rev. A 100, 062317 (2019)], the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems…
We consider the problem of deciding whether a given state preparation, i.e., a source of quantum states, is accurate, namely produces states close to a target one within a prescribed threshold. We show that, when multiple measurements need…
We present a variational algorithm for fault tolerant quantum computing to solve a system of linear equations which directly maximises the parameters of the target fidelity. This so-called measurement test algorithm can be applied to any…
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…
To get the best possible results from current quantum devices error mitigation is essential. In this work we present a simple but effective error mitigation technique based on the assumption that noise in a deep quantum circuit is well…
Quantum error mitigation (QEM) is a promising technique of protecting hybrid quantum-classical computation from decoherence, but it suffers from sampling overhead which erodes the computational speed. In this treatise, we provide a…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied…
Quantum machine learning represents a promising avenue for data processing, also for purposes of sequential temporal data analysis, as recently proposed in quantum reservoir computing (QRC). The possibility to operate on several platforms…
I generalize the well-known classical Metropolis-Hastings algorithm into a quantum algorithm that can equilibrate, measure, and mix a quantum thermal state on a quantum computer. It performs non-symmetric transitions on labels of state…
Preparing ground states and thermal states is essential for simulating quantum systems on quantum computers. Despite the hope for practical quantum advantage in quantum simulation, popular state preparation approaches have been challenged.…
We present a hardware agnostic error mitigation algorithm for near term quantum processors inspired by the classical Lanczos method. This technique can reduce the impact of different sources of noise at the sole cost of an increase in the…
Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task…
We propose a new scheme of measurement-based quantum computation (MBQC) using an error-correcting code against photon-loss in circuit quantum electrodynamics. We describe a specific protocol of logical single-qubit gates given by sequential…
Mixed states of a quantum system, represented by density operators, can be decomposed as a statistical mixture of pure states in a number of ways where each decomposition can be viewed as a different preparation recipe. However the fact…
Programmable neutral atom arrays show great promise for fault-tolerant quantum computing. A dominant physical error on this platform is qubit leakage and loss, notably decay errors from the Rydberg state during two-qubit gates. Such leakage…
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of…