Search

Randomized benchmarking provides a tool for obtaining precise quantitative estimates of the average error rate of a physical quantum channel. Here we define real randomized benchmarking, which enables a separate determination of the average error rate in the real and complex parts of the channel. This provides more fine-grained information about average error rates with approximately the same cost as the standard protocol. The protocol requires only averaging over the real Clifford group, a subgroup of the full complex Clifford group, and makes use of the fact that it forms an orthogonal 2-design. It therefore allows benchmarking of fault-tolerant gates for an encoding which does not contain the full Clifford group transversally. Furthermore, our results are especially useful when considering quantum computations on rebits (or real encodings of complex computations), in which case the real Clifford group now plays the role of the complex Clifford group when studying stabilizer circuits., Comment: 25 pages, v3: accepted in Quantum 2018-08-09

Well-controlled quantum devices with their increasing system size face a new roadblock hindering further development of quantum technologies: The effort of quantum tomography---the characterization of processes and states within a quantum device---scales unfavorably to the point that state-of-the-art systems can no longer be treated. Quantum compressed sensing mitigates this problem by reconstructing the state from an incomplete set of observables. In this work, we present an experimental implementation of compressed tomography of a seven qubit system---the largest-scale realization to date---and we introduce new numerical methods in order to scale the reconstruction to this dimension. Originally, compressed sensing has been advocated for density matrices with few non-zero eigenvalues. Here, we argue that the low-rank estimates provided by compressed sensing can be appropriate even in the general case. The reason is that statistical noise often allows only for the leading eigenvectors to be reliably reconstructed: We find that the remaining eigenvectors behave in a way consistent with a random matrix model that carries no information about the true state. We report a reconstruction of quantum states from a topological color code of seven qubits, prepared in a trapped ion architecture, based on tomographically incomplete data involving 127 Pauli basis measurement settings only, repeated 100 times each., Comment: 7 pages + 6 page appendix, 36 figures

One of the goals of probabilistic inference is to decide whether an empirically observed distribution is compatible with a candidate Bayesian network. However, Bayesian networks with hidden variables give rise to highly non-trivial constraints on the observed distribution. Here, we propose an information-theoretic approach, based on the insight that conditions on entropies of Bayesian networks take the form of simple linear inequalities. We describe an algorithm for deriving entropic tests for latent structures. The well-known conditional independence tests appear as a special case. While the approach applies for generic Bayesian networks, we presently adopt the causal view, and show the versatility of the framework by treating several relevant problems from that domain: detecting common ancestors, quantifying the strength of causal influence, and inferring the direction of causation from two-variable marginals., Comment: 10 pages + appendix, 5 figures. To appear in Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI2014)

Tensor network states constitute an important variational set of quantum states for numerical studies of strongly correlated systems in condensed-matter physics, as well as in mathematical physics. This is specifically true for finitely correlated states or matrix-product operators, designed to capture mixed states of one-dimensional quantum systems. It is a well-known open problem to find an efficient algorithm that decides whether a given matrix-product operator actually represents a physical state that in particular has no negative eigenvalues. We address and answer this question by showing that the problem is provably undecidable in the thermodynamic limit and that the bounded version of the problem is NP-hard in the system size. Furthermore, we discuss numerous connections between tensor network methods and (seemingly) different concepts treated before in the literature, such as hidden Markov models and tensor trains., Comment: 7 pages, 2 figures; published version with improved presentation

The problem of retrieving phase information from amplitude measurements alone has appeared in many scientific disciplines over the last century. PhaseLift is a recently introduced algorithm for phase recovery that is computationally efficient, numerically stable, and comes with rigorous performance guarantees. PhaseLift is optimal in the sense that the number of amplitude measurements required for phase reconstruction scales linearly with the dimension of the signal. However, it specifically demands Gaussian random measurement vectors - a limitation that restricts practical utility and obscures the specific properties of measurement ensembles that enable phase retrieval. Here we present a partial derandomization of PhaseLift that only requires sampling from certain polynomial size vector configurations, called t-designs. Such configurations have been studied in algebraic combinatorics, coding theory, and quantum information. We prove reconstruction guarantees for a number of measurements that depends on the degree t of the design. If the degree is allowed to to grow logarithmically with the dimension, the bounds become tight up to polylog-factors. Beyond the specific case of PhaseLift, this work highlights the utility of spherical designs for the derandomization of data recovery schemes., Comment: 32 pages, 1 figure. V2: added numerics, improved presentation. To appear in Journal of Fourier Analysis and Applications

If a one-dimensional quantum lattice system is subject to one step of a reversible discrete-time dynamics, it is intuitive that as much "quantum information" as moves into any given block of cells from the left, has to exit that block to the right. For two types of such systems - namely quantum walks and cellular automata - we make this intuition precise by defining an index, a quantity that measures the "net flow of quantum information" through the system. The index supplies a complete characterization of two properties of the discrete dynamics. First, two systems S_1, S_2 can be pieced together, in the sense that there is a system S which locally acts like S_1 in one region and like S_2 in some other region, if and only if S_1 and S_2 have the same index. Second, the index labels connected components of such systems: equality of the index is necessary and sufficient for the existence of a continuous deformation of S_1 into S_2. In the case of quantum walks, the index is integer-valued, whereas for cellular automata, it takes values in the group of positive rationals. In both cases, the map S -> ind S is a group homomorphism if composition of the discrete dynamics is taken as the group law of the quantum systems. Systems with trivial index are precisely those which can be realized by partitioned unitaries, and the prototypes of systems with non-trivial index are shifts., Comment: 38 pages. v2: added examples, terminology clarified

It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement-based quantum computing (MBQC), the need for a highly entangled initial state is particularly obvious. Defying this intuition, we show that quantum states can be too entangled to be useful for the purpose of computation. We prove that this phenomenon occurs for a dramatic majority of all states: the fraction of useful n-qubit pure states is less than exp(-n^2). Computational universality is hence a rare property in quantum states. This work highlights a new aspect of the question concerning the role entanglement plays for quantum computational speed-ups. The statements remain true if one allows for certain forms of post-selection and also cover the notion of CQ-universality. We identify scale-invariant states resulting from a MERA construction as likely candidates for physically relevant states subject to this effect., Comment: 5 pages, 2 figures, replaced with final version to appear in Phys. Rev. Lett. (except for an appendix and an additional figure)

We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building blocks in a construction kit - are (i) states on a one-dimensional chain of systems ("computational quantum wires") with the power to process one logical qubit and (ii) suitable couplings which connect the wires to a computationally universal "web". All elements are preparable by nearest-neighbor interactions in a single pass - a type of operation well-suited for a number of physical architectures. We provide a complete classification of qubit wires. This is first instance where a physically well-motivated class of universal resources can be fully understood. Finally, we sketch possible realizations in superlattices, and explore the power of coupling mechanisms based on Ising or exchange-interactions., Comment: 4 pages, 3 figures, small errors corrected, final version

When locally exciting a quantum lattice model, the excitation will propagate through the lattice. The effect is responsible for a wealth of non-equilibrium phenomena, and has been exploited to transmit quantum information through spin chains. It is a commonly expressed belief that for local Hamiltonians, any such propagation happens at a finite "speed of sound". Indeed, the Lieb-Robinson theorem states that in spin models, all effects caused by a perturbation are limited to a causal cone defined by a constant speed, up to exponentially small corrections. In this work we show that for translationally invariant bosonic models with nearest-neighbor interactions, this belief is incorrect: We prove that one can encounter excitations which accelerate under the natural dynamics of the lattice and allow for reliable transmission of information faster than any finite speed of sound. The effect is only limited by the model's range of validity (eventually by relativity). It also implies that in non-equilibrium dynamics of strongly correlated bosonic models far-away regions may become quickly entangled, suggesting that their simulation may be much harder than that of spin chains even in the low energy sector., Comment: 4+3 pages, 1 figure, some material added, typographic error fixed

We present a simple way to quantize the well-known Margulis expander map. The result is a quantum expander which acts on discrete Wigner functions in the same way the classical Margulis expander acts on probability distributions. The quantum version shares all essential properties of the classical counterpart, e.g., it has the same degree and spectrum. Unlike previous constructions of quantum expanders, our method does not rely on non-Abelian harmonic analysis. Analogues for continuous variable systems are mentioned. Indeed, the construction seems one of the few instances where applications based on discrete and continuous phase space methods can be developed in complete analogy., Comment: 12 pages, 1 figure. Slightly expanded, material on phase space methods added, reference to arXiv:0709.1142 appended, replaced with published version

We report progress on the LU-LC conjecture - an open problem in the context of entanglement in stabilizer states (or graph states). This conjecture states that every two stabilizer states which are related by a local unitary operation, must also be related by a local operation within the Clifford group. The contribution of this paper is a reduction of the LU-LC conjecture to a simpler problem - which, however, remains to date unsolved. As our main result, we show that, if the LU-LC conjecture could be proved for the restricted case of diagonal local unitary operations, then the conjecture is correct in its totality. Furthermore, the reduced version of the problem, involving such diagonal local operations, is mapped to questions regarding quadratic forms over the finite field GF(2). Finally, we prove that correctness of the LU-LC conjecture for stabilizer states implies a similar result for the more general case of stabilizer codes., Comment: 24 pages. Reference added

We introduce novel schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in [Phys. Rev. Lett. 98, 220503 (2007), quant-ph/0609149]. Our method makes use of tools from many-body physics - matrix product states, finitely correlated states or projected entangled pairs states - to show how measurements on entangled states can be viewed as processing quantum information. This work hence constitutes an instance where a quantum information problem - how to realize quantum computation - was approached using tools from many-body theory and not vice versa. We give a more detailed description of the setting, and present a large number of new examples. We find novel computational schemes, which differ from the original one-way computer for example in the way the randomness of measurement outcomes is handled. Also, schemes are presented where the logical qubits are no longer strictly localized on the resource state. Notably, we find a great flexibility in the properties of the universal resource states: They may for example exhibit non-vanishing long-range correlation functions or be locally arbitrarily close to a pure state. We discuss variants of Kitaev's toric code states as universal resources, and contrast this with situations where they can be efficiently classically simulated. This framework opens up a way of thinking of tailoring resource states to specific physical systems, such as cold atoms in optical lattices or linear optical systems., Comment: 21 pages, 7 figures

Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to form the final cluster state turns out to be crucially important. We determine the influence of this classical decision process on the expected size of the final cluster. Extending earlier work, we consider different quantum gates operating at various probabilites of success. For finite resources, we employ a computer algebra system to obtain the provably optimal classical control strategy and derive symbolic results for the expected final size of the cluster. We identify two regimes: When the success probability of the elementary gates is high, the influence of the classical control strategy is found to be negligible. In that case, other figures of merit become more relevant. In contrast, for small probabilities of success, the choice of an appropriate strategy is crucial., Comment: 7 pages, 9 figures, contribution to special issue of New J. Phys. on "Measurement-Based Quantum Information Processing". Replaced with published version

We present a framework, compliant with the general canonical principle of statistical mechanics, to define measures on the set of pure Gaussian states of continuous variable systems. Within such a framework, we define two specific measures, referred to as `micro-canonical' and `canonical', and apply them to study systematically the statistical properties of the bipartite entanglement of n-mode pure Gaussian states (as quantified by the entropy of a subsystem). We rigorously prove the "concentration of measure" around a finite average, occurring for the entanglement in the thermodynamical limit in both the canonical and the micro-canonical approach. For finite n, we determine analytically the average and standard deviation of the entanglement (as quantified by the reduced purity) between one mode and all the other modes. Furthermore, we numerically investigate more general situations, clearly showing that the onset of the concentration of measure already occurs at relatively small n., Comment: 24 pages, 5 figures, IOP style; conclusions extended, minor layout adjustment

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire unitary group. We present a simple necessary and sufficient criterion for deciding if a set of matrices constitutes a design. Lower bounds for the number of elements of 2-designs are derived. We show how to turn mutually unbiased bases into approximate 2-designs whose cardinality is optimal in leading order. Designs of higher order are discussed and an example of a unitary 5-design is presented. We comment on the relation between unitary and spherical designs and outline methods for finding designs numerically or by searching character tables of finite groups. Further, we sketch connections to problems in linear optics and questions regarding typical entanglement., Comment: 15 pages, one figure. Minor revisions to mirror version to appear in J. Math. Phys

We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique further develops tools from many-body physics - based on finitely correlated or projected entangled pair states - to go beyond the cluster-state based one-way computer. We identify resource states that are radically different from the cluster state, in that they exhibit non-vanishing correlation functions, can partly be prepared using gates with non-maximal entangling power, or have very different local entanglement properties. In the computational models, the randomness is compensated in a different manner. It is shown that there exist resource states which are locally arbitrarily close to a pure state. Finally, we comment on the possibility of tailoring computational models to specific physical systems as, e.g. cold atoms in optical lattices., Comment: 5 pages RevTeX, 1 figure, many diagrams. Title changed, presentation improved, material added

We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this amounts to finding the optimal classical strategy of fusing pieces of linear cluster states. A formal notion of classical configurations and strategies is introduced for probabilistic non-faulty gates. We study the asymptotic performance of strategies that can be simply described, and prove ultimate bounds to the performance of the globally optimal strategy. The arguments employ methods of random walks and convex optimization. This optimal strategy is also the one that requires the shortest storage time, and necessitates the fewest invocations of probabilistic gates. For two-dimensional cluster states, we find, for any elementary success probability, an essentially deterministic preparation of a cluster state with quadratic, hence optimal, asymptotic scaling in the use of entangled pairs. We also identify a percolation effect in state preparation, in that from a threshold probability on, almost all preparations will be either successful or fail. We outline the implications on linear optical architectures and fault-tolerant computations., Comment: 18 pages, 10 figures, replaced with published version

The physical meaning of entropy is analyzed in the context of statistical, nuclear, atomic physics and cosmology. Only the microcanonical Boltzmann entropy leads to no contradictions in several simple, elementary and for thermodynamics important situations. The conventional canonical statistics implies several serious errors and misinterpretations. This has far reaching consequences for phase-separations as well for the usual formulations of the second law. Applications in cosmology suffer under the ubiquitous use of canonical statistics. New reformulations in terms of microcanonical statistics are highly demanded but certainly difficult., Comment: 7 pages, 1 figure, presnted at XILV internat. winter meeting on nuclear physics in Bormio(Italy) 2006, January 29- Febr. 5

We show that, on a Hilbert space of odd dimension, the only pure states to possess a non-negative Wigner function are stabilizer states. The Clifford group is identified as the set of unitary operations which preserve positivity. The result can be seen as a discrete version of Hudson's Theorem. Hudson established that for continuous variable systems, the Wigner function of a pure state has no negative values if and only if the state is Gaussian. Turning to mixed states, it might be surmised that only convex combinations of stabilizer states give rise to non-negative Wigner distributions. We refute this conjecture by means of a counter-example. Further, we give an axiomatic characterization which completely fixes the definition of the Wigner function and compare two approaches to stabilizer states for Hilbert spaces of prime-power dimensions. In the course of the discussion, we derive explicit formulas for the number of stabilizer codes defined on such systems., Comment: 17 pages, 3 figures; References updated. Title changed to match published version. See also quant-ph/0702004

We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies, and present rigorous statements on the ultimate maximal and minimal use of resources of the globally optimal strategy. We find that this strategy - being also the most robust with respect to decoherence - gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared to other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a very significant reduction in resource consumption., Comment: 5 pages, 2 figures, title changed, presentation improved, bounds improved, minor errors corrected, references updated