Related papers: The Measurement Calculus
Contextuality - the obstruction to describing quantum mechanics in a classical statistical way - has been proposed as a resource that powers quantum computing. The measurement-based model provides a concrete manifestation of contextuality…
In this letter, we introduce a method to synthesize an $n$-qubit Clifford unitary $C$ from the stabilizer tableau of its inverse $C\dag$, using ancilla qubits and measurements. The procedure uses ancillary $|+\rangle$ states,…
We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all…
Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multi-qubit quantum state. It is computationally equivalent to the circuit model.…
This article is concerned with measure equivalence and uniform measure equivalence of locally compact, second countable groups. We show that two unimodular, locally compact, second countable groups are measure equivalent if and only if they…
We present a new approach to study measures on ensembles of contours, polymers or other objects interacting by some sort of exclusion condition. For concreteness we develop it here for the case of Peierls contours. Unlike existing methods,…
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum…
In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…
Despite multipartite entanglement being a global property of a quantum state, a number of recent works have made it clear that it can be quantified using only local measurements. This is appealing because local measurements are the easiest…
Quantum entanglement is one of the core features of quantum theory. While it is typically revealed by measurements along carefully chosen directions, here we review different methods based on so-called random or randomized measurements.…
Quantum correlations exhibit behaviour that cannot be resolved with a local hidden variable picture of the world. In quantum information, they are also used as resources for information processing tasks, such as Measurement-based Quantum…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…
There are two types of universality in measurement-based quantum computation (MBQC): ${\it strict}$ and ${\it computational}$. It is well known that the former is stronger than the latter. We present a method of transforming from a certain…
We propose a classification of measurement apparatuses based on their reliability and accessibility. Our notion of reliability parameterises the possibility of getting unexpected wrong results when using the apparatus in a given time…
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…
We will give a new model for measurements of a quantum system such that the measuring apparatuses are described by a unital separable non-type I nuclear simple C$^*$-algebra equipped with certain unital endomorphisms and pure states. An…
For qubits, Monte Carlo estimation of the average fidelity of Clifford unitaries is efficient -- it requires a number of experiments that is independent of the number $n$ of qubits and classical computational resources that scale only…
We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary…
Generalized Pauli's theorem, proved by D. S. Shirokov for two sets of anticommuting elements of a real or complexified Clifford algebra of dimension $2^n$, is extended to the case, when both sets of elements depend smoothly on points of…