Related papers: Pauli Flow on Open Graphs with Unknown Measurement…
The realisation of large-scale quantum computing is no longer simply a hardware question. The rapid development of quantum technology has resulted in dozens of control and programming problems that should be directed towards the classical…
Characterizing a quantum system by learning its state or evolution is a fundamental problem in quantum physics and learning theory with a myriad of applications. Recently, as a new approach to this problem, the task of agnostic state…
Large-scale variational quantum algorithms are widely recognized as a potential pathway to achieve practical quantum advantages. However, the presence of quantum noise might suppress and undermine these advantages, which blurs the…
We present a quantum process-tomography protocol based on a low-degree ansatz for the quantum channel, i.e. when it can be expressed as a fixed-degree polynomial in terms of Pauli operators. We demonstrate how to perform tomography of such…
We introduce a single-number metric, quantum volume, that can be measured using a concrete protocol on near-term quantum computers of modest size ($n\lesssim 50$), and measure it on several state-of-the-art transmon devices, finding values…
Low depth measurement-based quantum computation with qudits ($d$-level systems) is investigated and a precise relationship between this powerful model and qudit quantum circuits is derived in terms of computational depth and size…
A usual assumption in quantum estimation is that the unknown parameter labels the possible states of the system, while it influences neither the sample space of outcomes nor the measurement aimed at extracting information on the parameter…
We present a new method to measure the work $w$ performed on a driven quantum system and to sample its probability distribution $P(w)$. The method is based on a simple fact that remained unnoticed until now: Work on a quantum system can be…
Recently, a measure for the non-Markovian behavior of quantum processes in open systems has been developed which is based on the quantification of the flow of information between the open system and its environment [Phys. Rev. Lett. 103,…
An important question of quantum information is to characterize genuinely quantum (beyond-Clifford) resources necessary for universal quantum computing. Here, we use the Pauli spectrum to quantify how magic, beyond Clifford, typical…
We describe and analyze algorithms for classically simulating measurement of an $n$-qubit quantum state $\psi$ in the standard basis, that is, sampling a bit string $x$ from the probability distribution $|\langle x|\psi\rangle|^2$. Our…
Qubit-resolved operations and measurements are required for most current quantum information processing schemes. However, these operations can be experimentally costly due to the need for local addressing, demanding significant classical…
In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg…
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum…
This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures…
In this work we introduce a general scheme for measurement based quantum computation in continuous variables. Our approach does not necessarily rely on the use of ancillary cluster states to achieve its aim, but rather on the detection of a…
We present an abstract model of quantum computation, the "Pauli Fusion" model, whose primitive operations correspond closely to generators of the ZX calculus (a formal graphical language for quantum computing). The fundamental operations of…
We elucidate the regulator-sourced 2PI and average 1PI approaches for deriving exact flow equations in the case of a zero dimensional quantum field theory, wherein the scale dependence of the usual renormalisation group evolution is…
Pauli-based computation (PBC) provides a universal framework for executing fault-tolerant quantum algorithms using Pauli measurements and magic states. In monolithic architectures, the serialized nature of PBC directly ties runtime to a…