Searcharxiv⌕ Search

arXiv subjects

David Gross

Publications and source records attributed to David Gross.

71 records · Page 4Linked to original sources
arXiv2012

Negative Quasi-Probability as a Resource for Quantum Computation

A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection between the potential for quantum speed-up and the onset of negative values in a distinguished quasi-probability representation, a discrete analog of the Wigner function for quantum systems of odd dimension. This connection allows us to resolve an open question on the existence of bound states for magic-state distillation: we prove that there exist mixed states outside the convex hull of stabilizer states that cannot be distilled to non-stabilizer target states using stabilizer operations. We also provide an efficient simulation protocol for Clifford circuits that extends to a large class of mixed states, including bound universal states.

quant-ph↗
arXiv2012

Continuous-variable quantum compressed sensing

We significantly extend recently developed methods to faithfully reconstruct unknown quantum states that are approximately low-rank, using only a few measurement settings. Our new method is general enough to allow for measurements from a continuous family, and is also applicable to continuous-variable states. As a technical result, this work generalizes quantum compressed sensing to the situation where the measured observables are taken from a so-called tight frame (rather than an orthonormal basis) --- hence covering most realistic measurement scenarios. As an application, we discuss the reconstruction of quantum states of light from homodyne detection and other types of measurements, and we present simulations that show the advantage of the proposed compressed sensing technique over present methods. Finally, we introduce a method to construct a certificate which guarantees the success of the reconstruction with no assumption on the state, and we show how slightly more measurements give rise to "universal" state reconstruction that is highly robust to noise.

quant-ph↗
arXiv2012

Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators

Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. First, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e., the sample complexity of tomography decreases with the rank. Second, we show that unknown low-rank states can be reconstructed from an incomplete set of measurements, using techniques from compressed sensing and matrix completion. These techniques use simple Pauli measurements, and their output can be certified without making any assumptions about the unknown state. We give a new theoretical analysis of compressed tomography, based on the restricted isometry property (RIP) for low-rank matrices. Using these tools, we obtain near-optimal error bounds, for the realistic situation where the data contains noise due to finite statistics, and the density matrix is full-rank with decaying eigenvalues. We also obtain upper-bounds on the sample complexity of compressed tomography, and almost-matching lower bounds on the sample complexity of any procedure using adaptive sequences of Pauli measurements. Using numerical simulations, we compare the performance of two compressed sensing estimators with standard maximum-likelihood estimation (MLE). We find that, given comparable experimental resources, the compressed sensing estimators consistently produce higher-fidelity state reconstructions than MLE. In addition, the use of an incomplete set of measurements leads to faster classical processing with no loss of accuracy. Finally, we show how to certify the accuracy of a low rank estimate using direct fidelity estimation and we describe a method for compressed quantum process tomography that works for processes with small Kraus rank.

quant-ph↗
arXiv2011

The monomial representations of the Clifford group

We show that the Clifford group - the normaliser of the Weyl-Heisenberg group - can be represented by monomial phase-permutation matrices if and only if the dimension is a square number. This simplifies expressions for SIC vectors, and has other applications to SICs and to Mutually Unbiased Bases. Exact solutions for SICs in dimension 16 are presented for the first time.

quant-ph↗
arXiv2011

Efficient quantum state tomography

Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes infeasible because the number of quantum measurements and the amount of computation required to process them grows exponentially in the system size. Here we show that we can do exponentially better than direct state tomography for a wide range of quantum states, in particular those that are well approximated by a matrix product state ansatz. We present two schemes for tomography in 1-D quantum systems and touch on generalizations. One scheme requires unitary operations on a constant number of subsystems, while the other requires only local measurements together with more elaborate post-processing. Both schemes rely only on a linear number of experimental operations and classical postprocessing that is polynomial in the system size. A further strength of the methods is that the accuracy of the reconstructed states can be rigorously certified without any a priori assumptions.

quant-ph↗
arXiv2011

Permutationally invariant quantum tomography

We present a scalable method for the tomography of large multiqubit quantum registers. It acquires information about the permutationally invariant part of the density operator, which is a good approximation to the true state in many, relevant cases. Our method gives the best measurement strategy to minimize the experimental effort as well as the uncertainties of the reconstructed density matrix. We apply our method to the experimental tomography of a photonic four-qubit symmetric Dicke state.

quant-ph↗
arXiv2010

Probing the negative Wigner function of a pulsed single photon point by point

We investigate quantum properties of pulsed light fields point by point in phase space. We probe the negative region of the Wigner function of a single photon generated by the means of waveguided parametric down-conversion. This capability is achieved by employing loss-tolerant photon-number resolving detection, allowing us to directly observe the oscillations of the photon statistics in dependence of applied displacements in phase space. Our scheme is highly mode sensitive and can reveal the single-mode character of the signal state.

quant-ph↗
arXiv2010

Concentration of measure for quantum states with a fixed expectation value

Given some observable H of a finite-dimensional quantum system, we investigate the typical properties of random quantum state vectors that have a fixed expectation value with respect to H. Under some some conditions on the spectrum, we prove that this manifold of quantum states shows a concentration of measure phenomenon: any continuous function on this set is almost everywhere close to its mean. We also give a method to estimate the corresponding expectation values analytically, and we prove a formula for the typical reduced density matrix in the case that H is a sum of local observables. We discuss the implications of our results as new proof tools in quantum information theory and to study phenomena in quantum statistical mechanics. As a by-product, we derive a method to sample the resulting distribution numerically, which generalizes the well-known Gaussian method to draw random states from the sphere.

quant-ph↗
arXiv2010

Recovering low-rank matrices from few coefficients in any basis

We present novel techniques for analyzing the problem of low-rank matrix recovery. The methods are both considerably simpler and more general than previous approaches. It is shown that an unknown (n x n) matrix of rank r can be efficiently reconstructed from only O(n r nu log^2 n) randomly sampled expansion coefficients with respect to any given matrix basis. The number nu quantifies the "degree of incoherence" between the unknown matrix and the basis. Existing work concentrated mostly on the problem of "matrix completion" where one aims to recover a low-rank matrix from randomly selected matrix elements. Our result covers this situation as a special case. The proof consists of a series of relatively elementary steps, which stands in contrast to the highly involved methods previously employed to obtain comparable results. In cases where bounds had been known before, our estimates are slightly tighter. We discuss operator bases which are incoherent to all low-rank matrices simultaneously. For these bases, we show that O(n r nu log n) randomly sampled expansion coefficients suffice to recover any low-rank matrix with high probability. The latter bound is tight up to multiplicative constants.

cs.IT↗
arXiv2010

Quantum state tomography via compressed sensing

We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In particular, they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rd log^2 d) measurement settings, compared to standard methods that require d^2 settings. Our methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements, use fast convex optimization, are stable against noise, and can be applied to states that are only approximately low-rank. The acquired data can be used to certify that the state is indeed close to pure, so no a priori assumptions are needed. We present both theoretical bounds and numerical simulations.

quant-ph↗
arXiv2010

Note on sampling without replacing from a finite collection of matrices

This technical note supplies an affirmative answer to a question raised in a recent pre-print [arXiv:0910.1879] in the context of a "matrix recovery" problem. Assume one samples m Hermitian matrices X_1, ..., X_m with replacement from a finite collection. The deviation of the sum X_1+...+X_m from its expected value in terms of the operator norm can be estimated by an "operator Chernoff-bound" due to Ahlswede and Winter. The question arose whether the bounds obtained this way continue to hold if the matrices are sampled without replacement. We remark that a positive answer is implied by a classical argument by Hoeffding. Some consequences for the matrix recovery problem are sketched.

cs.IT↗
arXiv2010

All reversible dynamics in maximally non-local theories are trivial

A remarkable feature of quantum theory is non-locality (i.e. the presence of correlations which violate Bell inequalities). However, quantum correlations are not maximally non-local, and it is natural to ask whether there are compelling reasons for rejecting theories in which stronger violations are possible. To shed light on this question, we consider post-quantum theories in which maximally non-local states (non-local boxes) occur. It has previously been conjectured that the set of dynamical transformations possible in such theories is severely limited. We settle the question affirmatively in the case of reversible dynamics, by completely characterizing all such transformations allowed in this setting. We find that the dynamical group is trivial, in the sense that it is generated solely by local operations and permutations of systems. In particular, no correlations can ever be created; non-local boxes cannot be prepared from product states (in other words, no analogues of entangling unitary operations exist), and classical computers can efficiently simulate all such processes.

quant-ph↗
arXiv2010

Heralded Polynomial-Time Quantum State Tomography

We describe an algorithm for quantum state tomography that converges in polynomial time to an estimate, together with a rigorous error bound on the fidelity between the estimate and the true state. The result suggests that state tomography on large quantum systems may be much more feasible than the exponential size of state space suggests. In many situations, the correctness of the state estimate can be certified from the data alone, with no a priori assumptions on the form of the measured state.

quant-ph↗
arXiv2007

Efficient 2-designs from bases exist

We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications in quantum information theory (e.g. in state tomography, cloning, or cryptography) -- however it is suspected that maximal sets exist only in prime-power dimensions. Our construction offers an efficient alternative for general dimensions. The findings are based on a framework recently established in [A. Roy and A. Scott, J. Math. Phys. 48, 072110 (2007)], which reduces the construction of such bases to the combinatorial problem of finding certain highly nonlinear functions between abelian groups.

quant-ph↗
arXiv2007

Non-negative Wigner functions in prime dimensions

According to a classical result due to Hudson, the Wigner function of a pure, continuous variable quantum state is non-negative if and only if the state is Gaussian. We have proven an analogous statement for finite-dimensional quantum systems. In this context, the role of Gaussian states is taken on by stabilizer states. The general results have been published in [D. Gross, J. Math. Phys. 47, 122107 (2006)]. For the case of systems of odd prime dimension, a greatly simplified proof can be employed which still exhibits the main ideas. The present paper gives a self-contained account of these methods.

quant-ph↗
arXiv1997

The Triumph And Limitations Of Quantum Field Theory

Talk presented at the conference ``Historical and Philosophical Reflections on the Foundations of Quantum Field Theory,'' at Boston University, March 1996. It will be published in the proceedings of this conference.

hep-th↗