Quantum De Finetti Theorem Research Articles

Learning properties of quantum states without the IID assumption

We develop a framework for learning properties of quantum states beyond the assumption of independent and identically distributed (i.i.d.) input states. We prove that, given any learning problem (under reasonable assumptions), an algorithm designed for i.i.d. input states can be adapted to handle input states of any nature, albeit at the expense of a polynomial increase in training data size (aka sample complexity). Importantly, this polynomial increase in sample complexity can be substantially improved to polylogarithmic if the learning algorithm in question only requires non-adaptive, single-copy measurements. Among other applications, this allows us to generalize the classical shadow framework to the non-i.i.d. setting while only incurring a comparatively small loss in sample efficiency. We leverage permutation invariance and randomized single-copy measurements to derive a new quantum de Finetti theorem that mainly addresses measurement outcome statistics and, in turn, scales much more favorably in Hilbert space dimension.

Quantum de Finetti Theorems as Categorical Limits, and Limits of State Spaces of C*-algebras

Quantum de Finetti Theorems as Categorical Limits, and Limits of State Spaces of C*-algebras

The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario

It is a fundamental but difficult problem to characterize the set of correlations that can be obtained by performing measurements on quantum mechanical systems. The problem is particularly challenging when the preparation procedure for quantum states is assumed to comply with a given causal structure. Recently, a first completeness result for this quantum causal compatibility problem has been given based on the so-called quantum inflation technique. However, completeness was achieved by imposing additional technical constraints, such as an upper bound on the Schmidt rank of the observables. Here, we show that these complications are unnecessary in the quantum bilocal scenario, a much-studied abstract model of entanglement swapping experiments. We prove that the quantum inflation hierarchy is complete for the bilocal scenario in the commuting observable model of locality. We also give a bilocal version of an observation by Tsirelson, namely, in finite dimensions, the commuting observable model and the tensor product model of locality coincide. These results answer questions recently posed by Renou and Xu [arXiv:2210.09065v2 (2022)]. Finally, we point out that our techniques can be interpreted more generally as giving rise to a semidefinite programming hierarchy that is complete for the problem of optimizing polynomial functions in the states of operator algebras defined by generators and relations. The completeness of this polarization hierarchy follows from a quantum de Finetti theorem for states on maximal C*-tensor products.

A Convergent Inflation Hierarchy for Quantum Causal Structures

A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a distribution is compatible with a structure is a practically and fundamentally relevant, yet very difficult problem. Only recently has a general class of algorithms been proposed: These so-called inflation techniques associate to any causal structure a hierarchy of increasingly strict compatibility tests, where each test can be formulated as a computationally efficient convex optimization problem. Remarkably, it has been shown that in the classical case, this hierarchy is complete in the sense that each non-compatible distribution will be detected at some level of the hierarchy. An inflation hierarchy has also been formulated for causal structures that allow for the observed classical random variables to arise from measurements on quantum states—however, no proof of completeness of this quantum inflation hierarchy has been supplied. In this paper, we construct a first version of the quantum inflation hierarchy that is provably convergent. It takes an additional parameter, r, which can be interpreted as an upper bound on the Schmidt rank of the observables involved. For each r, it provides a family of increasingly strict and ultimately complete compatibility tests for correlations that are compatible with a given causal structure under this Schmidt rank constraint. From a technical point of view, convergence proofs are built on de Finetti theorems, which show that certain symmetries (which can be imposed in convex optimization problems) imply independence of random variables (which is not directly a convex constraint). A main technical ingredient to our proof is a Quantum de Finetti Theorem that holds for general tensor products of C^*-algebras, generalizing previous work that was restricted to minimal tensor products.

A refinement of Reznick's Positivstellensatz with applications to quantum information theory

In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always be chosen as an N-th power of the squared norm of the variables and gave explicit bounds on N. By using concepts from quantum information theory (such as partial traces, optimal cloning maps, and an identity due to Chiribella) we give simpler proofs and minor improvements of both real and complex versions of this result. Moreover, we discuss constructions of Hilbert identities using Gaussian integrals and we review an elementary method to construct complex spherical designs. Finally, we apply our results to give improved bounds for exponential quantum de Finetti theorems in the real and in the complex setting.

Semidefinite programming hierarchies for constrained bilinear optimization

We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form {mathrm {Tr}}big [H(Dotimes E)big ], maximized with respect to semidefinite constraints on D and E. Applied to the problem of approximate error correction in quantum information theory, this gives hierarchies of efficiently computable outer bounds on the success probability of approximate quantum error correction codes in any dimension. The first level of our hierarchies corresponds to a previously studied relaxation (Leung and Matthews in IEEE Trans Inf Theory 61(8):4486, 2015) and positive partial transpose constraints can be added to give a sufficient criterion for the exact convergence at a given level of the hierarchy. To quantify the worst case convergence speed of our sum-of-squares hierarchies, we derive novel quantum de Finetti theorems that allow imposing linear constraints on the approximating state. In particular, we give finite de Finetti theorems for quantum channels, quantifying closeness to the convex hull of product channels as well as closeness to local operations and classical forward communication assisted channels. As a special case this constitutes a finite version of Fuchs-Schack-Scudo’s asymptotic de Finetti theorem for quantum channels. Finally, our proof methods answer a question of Brandão and Harrow (Proceedings of the forty-fourth annual ACM symposium on theory of computing, STOC’12, p 307, 2012) by improving the approximation factor of de Finetti theorems with no symmetry from O(d^{k/2}) to {mathrm {poly}}(d,k), where d denotes local dimension and k the number of copies.

Non linear Schrödinger limit of bosonic ground states, again

I review an information-theoretic variant of the quantum de Finetti theorem due to Brandao and Harrow and discuss its applications to the topic of bosonic mean-field limits. This leads to slightly improved methods for the derivation of the local non-linear Schrodinger energy functional from many-body quantum mechanics.

Improved quantum de Finetti theorem and its application in quantum key distribution

Quantum de Finetti theorem indicates that a surprising connection exists between the permutation-invariant property of a large system and the independent, identical distribution that describes its subsystems. The theorem is highly nontrivial in that it allows one to infer independence---within a finite error---from symmetry alone, both of which are important and fundamental concepts in physics and mathematics. Here, we present an improved quantum de Finetti theorem that provides a lower error bound, thus establishing an even closer relationship between symmetry and independence than before. As application, we study the security of quantum key distribution under the most general attacks, and show that the key rate is higher than previous ones obtained by existing trace-norm-based de Finetti theorems. Therefore, the application of the quantum de Finetti theorem in quantum information processing, as well as developing the theorem itself, is advanced here.

The derivation of the $$\mathbb {T}^{3}$$ T 3 energy-critical NLS from quantum many-body dynamics

We derive the 3D energy critical quintic NLS from quantum many-body dynamics with 3-body interaction in the T^3 (periodic) setting. Due to the known complexity of the energy critical setting, previous progress was limited in comparison to the 2-body interaction case yielding energy subcritical cubic NLS. Previously, the only result for the 3D energy critical case was HTX, which proved the uniqueness part of the argument in the case of small solutions. In the main part of this paper, we develop methods to prove the convergence of the BBGKY hierarchy to the infinite Gross-Pitaevskii (GP) hierarchy, and separately, the uniqueness of large GP solutions. Since the trace estimate used in the previous proofs of convergence is the false sharp trace estimate in our setting, we instead introduce a new frequency interaction analysis and apply the finite dimensional quantum de Finetti theorem. For the large solution uniqueness argument, we discover the new HUFL (hierarchical uniform frequency localization) property for the GP hierarchy and use it to prove a new type of uniqueness theorem. The HUFL property reduces to a new statement even for NLS. With the help of CKSTT,IP which proved the global well-posedness for the quintic NLS, this new uniqueness theorem establishes global uniqueness.

Resource-efficient verification of quantum computing using Serfling\u2019s bound

Verifying quantum states is central to certifying the correct operation of various quantum information processing tasks. In particular, in measurement-based quantum computing, checking whether correct graph states are generated is essential for reliable quantum computing. Several verification protocols for graph states have been proposed, but none of these are particularly resource efficient: multiple copies are required to extract a single state that is guaranteed to be close to the ideal one. The best protocol currently known requires O(n15) copies of the state, where n is the size of the graph state. In this paper, we construct a significantly more resource-efficient verification protocol for graph states that only requires O(n5 log n) copies. The key idea is to employ Serfling’s bound, which is a probability inequality in classical statistics. Utilizing Serfling’s bound also enables us to generalize our protocol for qudit and continuous-variable graph states. Constructing a resource-efficient verification protocol for them is non-trivial. For example, the previous verification protocols for qubit graph states that use the quantum de Finetti theorem cannot be generalized to qudit and continuous-variable graph states without tremendously increasing the resource overhead. This is because the overhead caused by the quantum de Finetti theorem depends on the local dimension. On the other hand, in our protocol, the resource overhead is independent of the local dimension, and therefore generalizing to qudit or continuous-variable graph states does not increase the overhead. The flexibility of Serfling’s bound also makes our protocol robust: our protocol accepts slightly noisy but still useful graph states.

Negative energy blowup results for the focusing Hartree hierarchy via identities of virial and localized virial type

We establish virial and localized virial identities for solutions to the Hartree hierarchy, an infinite system of partial differential equations which arises in mathematical modeling of many body quantum systems. As an application, we use arguments originally developed in the study of the nonlinear Schrödinger equation (see work of Zakharov, Glassey, and Ogawa–Tsutsumi) to show that certain classes of negative energy solutions must blowup in finite time. The most delicate case of this analysis is the proof of negative energy blowup without the assumption of finite variance; in this case, we make use of the localized virial estimates, combined with the quantum de Finetti theorem of Hudson and Moody and several algebraic identities adapted to our particular setting. Application of a carefully chosen truncation lemma then allows for the additional terms produced in the localization argument to be controlled.

SU(p,q) coherent states and a Gaussian de Finetti theorem

We prove a generalization of the quantum de Finetti theorem when the local space is an infinite-dimensional Fock space. In particular, instead of considering the action of the permutation group on n copies of that space, we consider the action of the unitary group U(n) on the creation operators of the n modes and define a natural generalization of the symmetric subspace as the space of states invariant under unitaries in U(n). Our first result is a complete characterization of this subspace, which turns out to be spanned by a family of generalized coherent states related to the special unitary group SU(p, q) of signature (p, q). More precisely, this construction yields a unitary representation of the noncompact simple real Lie group SU(p, q). We therefore find a dual unitary representation of the pair of groups U(n) and SU(p, q) on an n(p + q)-mode Fock space. The (Gaussian) SU(p, q) coherent states resolve the identity on the symmetric subspace, which implies a Gaussian de Finetti theorem stating that tracing over a few modes of a unitary-invariant state yields a state close to a mixture of Gaussian states. As an application of this de Finetti theorem, we show that the n × n upper-left submatrix of an n × n Haar-invariant unitary matrix is close in total variation distance to a matrix of independent normal variables if n3 = O(m).

A fermionic de Finetti theorem

Quantum versions of de Finetti’s theorem are powerful tools, yielding conceptually important insights into the security of key distribution protocols or tomography schemes and allowing one to bound the error made by mean-field approaches. Such theorems link the symmetry of a quantum state under the exchange of subsystems to negligible quantum correlations and are well understood and established in the context of distinguishable particles. In this work, we derive a de Finetti theorem for finite sized Majorana fermionic systems. It is shown, much reflecting the spirit of other quantum de Finetti theorems, that a state which is invariant under certain permutations of modes loses most of its anti-symmetric character and is locally well described by a mode separable state. We discuss the structure of the resulting mode separable states and establish in specific instances a quantitative link to the quality of the Hartree-Fock approximation of quantum systems. We hint at a link to generalized Pauli principles for one-body reduced density operators. Finally, building upon the obtained de Finetti theorem, we generalize and extend the applicability of Hudson’s fermionic central limit theorem.

Inductive Supervised Quantum Learning.

In supervised learning, an inductive learning algorithm extracts general rules from observed training instances, then the rules are applied to test instances. We show that this splitting of training and application arises naturally, in the classical setting, from a simple independence requirement with a physical interpretation of being nonsignaling. Thus, two seemingly different definitions of inductive learning happen to coincide. This follows from the properties of classical information that break down in the quantum setup. We prove a quantum de Finetti theorem for quantum channels, which shows that in the quantum case, the equivalence holds in the asymptotic setting, that is, for large numbers of test instances. This reveals a natural analogy between classical learning protocols and their quantum counterparts, justifying a similar treatment, and allowing us to inquire about standard elements in computational learning theory, such as structural risk minimization and sample complexity.

On the equivalence of separability and extendability of quantum states

Motivated by the notions of [Formula: see text]-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al. [Complete family of separability criteria, Phys. Rev. A 69 (2004) 022308], we introduce parallel definitions in the context of Gaussian states and using only properties of their covariance matrices, derive necessary and sufficient conditions for their complete extendability. It turns out that the complete extendability property is equivalent to the separability property of a bipartite Gaussian state. Following the proof of quantum de Finetti theorem as outlined in Hudson and Moody [Locally normal symmetric states and an analogue of de Finetti’s theorem, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 33(4) (1975/76) 343–351], we show that separability is equivalent to complete extendability for a state in a bipartite Hilbert space where at least one of which is of dimension greater than 2. This, in particular, extends the result of Fannes, Lewis, and Verbeure [Symmetric states of composite systems, Lett. Math. Phys. 15(3) (1988) 255–260] to the case of an infinite dimensional Hilbert space whose C* algebra of all bounded operators is not separable.

Quantum de Finetti Theorems Under Local Measurements with Applications

Quantum de Finetti theorems are a useful tool in the study of correlations in quantum multipartite states. In this paper we prove two new quantum de Finetti theorems, both showing that under tests formed by local measurements one can get a much improved error dependence on the dimension of the subsystems. We also obtain similar results for non-signaling probability distributions. We give the following applications of the results: We prove the optimality of the Chen-Drucker protocol for 3-SAT, under the exponential time hypothesis. We show that the maximum winning probability of free games can be estimated in polynomial time by linear programming. We also show that 3-SAT with m variables can be reduced to obtaining a constant error approximation of the maximum winning probability under entangled strategies of O(m^{1/2})-player one-round non-local games, in which the players communicate O(m^{1/2}) bits all together. We show that the optimization of certain polynomials over the hypersphere can be performed in quasipolynomial time in the number of variables n by considering O(log(n)) rounds of the Sum-of-Squares (Parrilo/Lasserre) hierarchy of semidefinite programs. As an application to entanglement theory, we find a quasipolynomial-time algorithm for deciding multipartite separability. We consider a result due to Aaronson -- showing that given an unknown n qubit state one can perform tomography that works well for most observables by measuring only O(n) independent and identically distributed (i.i.d.) copies of the state -- and relax the assumption of having i.i.d copies of the state to merely the ability to select subsystems at random from a quantum multipartite state. The proofs of the new quantum de Finetti theorems are based on information theory, in particular on the chain rule of mutual information.

Physical origins of ruled surfaces on the reduced density matrices geometry

The reduced density matrices (RDMs) of many-body quantum states form a convex set. The boundary of low dimensional projections of this convex set may exhibit nontrivial geometry such as ruled surfaces. In this paper, we study the physical origins of these ruled surfaces for bosonic systems. The emergence of ruled surfaces was recently proposed as signatures of symmetry-breaking phase. We show that, apart from being signatures of symmetry-breaking, ruled surfaces can also be the consequence of gapless quantum systems by demonstrating an explicit example in terms of a two-mode Ising model. Our analysis was largely simplified by the quantum de Finetti's theorem---in the limit of large system size, these RDMs are the convex set of all the symmetric separable states. To distinguish ruled surfaces originated from gapless systems from those caused by symmetry-breaking, we propose to use the finite size scaling method for the corresponding geometry. This method is then applied to the two-mode XY model, successfully identifying a ruled surface as the consequence of gapless systems.

Ground states of large bosonic systems : the Gross–Pitaevskii limit revisited

We study the ground state of a dilute Bose gas in a scaling limit where the Gross-Pitaevskii functional emerges. This is a repulsive non-linear Schr\"odinger functional whose quartic term is proportional to the scattering length of the interparticle interaction potential. We propose a new derivation of this limit problem, with a method that bypasses some of the technical difficulties that previous derivations had to face. The new method is based on a combination of Dyson's lemma, the quantum de Finetti theorem and a second moment estimate for ground states of the effective Dyson Hamiltonian. It applies equally well to the case where magnetic fields or rotation are present.

Quantum de Finetti theorems and mean-field theory from quantum phase space representations

We introduce the number-conserving quantum phase space description as a versatile tool to address fundamental aspects of quantum many-body systems. Using phase space methods we prove two alternative versions of the quantum de Finetti theorem for finite-dimensional bosonic quantum systems, which states that a reduced density matrix of a many-body quantum state can be approximated by a convex combination of product states where the error is proportional to the inverse particle number. This theorem provides a formal justification for the mean-field description of many-body quantum systems, as it shows that quantum correlations can be neglected for the calculation of few-body observables when the particle number is large. Furthermore we discuss methods to derive the exact evolution equations for quantum phase space distribution functions as well as upper and lower bounds for the ground state energy. As an important example, we consider the Bose–Hubbard model and show that the mean-field dynamics is given by a classical phase space flow equivalent to the discrete Gross–Pitaevskii equation.

Uniqueness of solutions to the 3D quintic Gross–Pitaevskii hierarchy

In this paper, we study solutions to the three-dimensional quintic Gross–Pitaevskii hierarchy. We prove unconditional uniqueness among all small solutions in the critical space H1 (which corresponds to H1 on the NLS level). With slight modifications to the proof, we also prove unconditional uniqueness of solutions to the Hartree hierarchy without a smallness condition. Our proof uses the quantum de Finetti theorem, and is an extension of the work by Chen, Hainzl, Pavlović, and Seiringer [9], and our previous work [32].