In the realistic quantum key distribution (QKD), Alice and Bob respectively get a quantum state from an unknown channel, whose dimension may be unknown. However, while discussing the security, sometime we need to know exact dimension, since current exponential de Finetti theorem, crucial to the information-theoretical security proof, is deeply related with the dimension and can only be applied to finite dimensional case. Here we address this problem in detail. We show that if POVM elements corresponding to Alice and Bob's measured results can be well described in a finite dimensional subspace with sufficiently small error, then dimensions of Alice and Bob's states can be almost regarded as finite. Since the security is well defined by the smooth entropy, which is continuous with the density matrix, the small error of state actually means small change of security. Then the security of unknown-dimensional system can be solved. Finally we prove that for heterodyne detection continuous variable QKD and differential phase shift QKD, the collective attack is optimal under the infinite key size case.
We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma, and the Chernoff bound, but avoids virtually all calculations, including any use of the theory of types.
In its most basic form, the finite quantum de Finetti theorem states that the reduced k-partite density operator of an n-partite symmetric state can be approximated by a convex combination of k-fold product states. Variations of this result include Renner's "exponential" approximation by "almost-product" states, a theorem which deals with certain triples of representations of the unitary group, and D'Cruz et al.'s result for infinite-dimensional systems. We show how these theorems follow from a single, general de Finetti theorem for representations of symmetry groups, each instance correspondi…
Establishing the security of continuous-variable quantum key distribution against general attacks in a realistic finite-size regime is an outstanding open problem in the field of theoretical quantum cryptography if we restrict our attention to protocols that rely on the exchange of coherent states. Indeed, techniques based on the uncertainty principle are not known to work for such protocols, and the usual tools based on de Finetti reductions only provide security for unrealistically large block lengths. We address this problem here by considering a new type of Gaussian de Finetti reduction, t…
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 …
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for any arbitrary input, it is sufficient to consider the special case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. A similar statement holds for more general channels which are covariant with respect to the action of an arbitrary finite …
We prove the security of Gaussian continuous-variable quantum key distribution against arbitrary attacks in the finite-size regime. The novelty of our proof is to consider symmetries of quantum key distribution in phase space in order to show that, to good approximation, the Hilbert space of interest can be considered to be finite-dimensional, thereby allowing for the use of the postselection technique introduced by Christandl, Koenig and Renner (Phys. Rev. Lett. 102, 020504 (2009)). Our result greatly improves on previous work based on the de Finetti theorem which could not provide security f…
We derive a bound for the security of QKD with finite resources under one-way post-processing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols like Bennett-Brassard 1984 and six-states. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N\sim 10^5 signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained us…
Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this work, we describe a similar duality theory for tensor powers of Clifford unitaries. The Clifford group is a central object in many subfields of quantum information, most prominently in the theory of fault-tolerance. The duality theory has a simple and clean description in terms of finite geometries. We demonstrate its effectiveness in several applications: (1) …
We provide a security analysis of continuous-variable quantum key distribution (CVQKD) with discrete modulation against general attacks in a realistic finite-size regime. To realize this goal, we first prove security of the continuous-variable quantum key distribution protocol with discrete modulation against collective attacks by using the reliable tomography of the covariance matrix, leading to the reliable and tight error bounds in the derived confidence regions. Combining the proof with de Finetti reduction, the discrete-modulation-based continuous-variable quantum key distribution (DM-CVQ…
A practical quantum key distribution (QKD) protocol necessarily runs in finite time and, hence, only a finite amount of communication is exchanged. This is in contrast to most of the standard results on the security of QKD, which only hold in the limit where the number of transmitted signals approaches infinity. Here, we analyze the security of QKD under the realistic assumption that the amount of communication is finite. At the level of the general formalism, we present new results that help simplifying the actual implementation of QKD protocols: in particular, we show that symmetrization ste…
We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a semidefinite program of size $\exp(\mathcal{O}\big(T^{12}(\log^2(AT)+\log(Q)\log(AT))/ε^2\big))$ to compute additive $ε$-approximations on the values of two-player free games with $T\times T$-dimensional quantum assistance, where $A$ and $Q$ denote the numbers of answers and questions of the game, respectively. For fixed dimension $T$, this scales polynomially in $Q…
A remarkable feature of typical ground states of strongly-correlated many-body systems is that the entanglement entropy is not an extensive quantity. In one dimension, there exists a proof that a finite correlation length sets a constant upper-bound on the entanglement entropy, called the area law. However, the known bound exists only in a hypothetical limit, rendering its physical relevance highly questionable. In this paper, we give a simple proof of the area law for entanglement entropy in one dimension under the condition of exponentially decaying correlations. Our proof dramatically reduc…
In quantum physics, the density operator completely describes the state. Instead, in classical physics the mean value of every physical quantity is evaluated by means of a probability distribution. We study the possibility to describe pure quantum states and events with classical probability distributions and conditional probabilities and prove that the distributions can not be quadratic functions of the quantum state. Some examples are considered. Finally, we deal with the exponential complexity problem of quantum physics and introduce the concept of classical dimension for a quantum system.
We study the possibility to describe pure quantum states and evens with classical probability distributions and conditional probabilities and show that the distributions and/or conditional probabilities have to assume negative values, except for a simple model whose realistic space dimension is not smaller than the Hilbert space dimension of the quantum system. This gives a negative answer to a question proposed by Montina [Phys.Rev.Lett.{\bf 97}, 180401 (2006)] whether or not does there exist a classical theory whose phase-space dimension is much smaller than the Hilbert space dimension for a…
Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to …
Given a quantum many-body system and the expectation-value dynamics of some operator, we study how this reference dynamics is altered due to a perturbation of the system's Hamiltonian. Based on projection operator techniques, we unveil that if the perturbation exhibits a random-matrix structure in the eigenbasis of the unperturbed Hamiltonian, then this perturbation effectively leads to an exponential damping of the original dynamics. Employing a combination of dynamical quantum typicality and numerical linked cluster expansions, we demonstrate that our theoretical findings for random matrices…
Recently, [{arXiv:0810.3134}] is accepted and published. We show that local realistic theories violate separability of $N$-qubit quantum states by a factor of $3^N$. Thus we have a violation factor of 3 when N=1. Realistic theories violate a proposition of a single qubit (a state with two-dimensional space) system, the Bloch sphere machinery of quantum mechanics. Our method uses the ratio of each of the scalar products. The maximal possible value of the scalar product in local realistic theories grows exponentially larger than one in $N$-qubit separable states when the number of qubits increas…
Randomized benchmarking with non-Markovian noise and realistic finite-time gates
Pritzker School of Molecular Engineering, University of Chicago（芝加哥大学普里茨克分子工程学院）；National Center for Computational Sciences, Oak Ridge National Laboratory（橡树岭国家实验室国家计算科学中心）；IBM Quantum, IBM T.J. Watson Research Center（IBM量子，IBM T.J.沃森研究中心）；Department of Physics and Astronomy, Northwestern University（西北大学物理与天文学系）
The exponential and Gaussian functions are among the most fundamental and important operations, appearing ubiquitously throughout all areas of science, engineering, and mathematics. Whereas formally, it is well-known that any function may in principle be realized on a quantum computer, in practice present-day algorithms tend to be very expensive. In this work, we present algorithms for evaluating exponential and Gaussian functions efficiently on quantum computers. The implementations require a (generally) small number of multiplications, which represent the overall computational bottleneck. Fo…
We provide a simple and realistic model to study memory effects in a lossy bosonic quantum channel over arbitrary number of uses. The noise correlation among different uses is introduced by contiguous modes interactions which results in an exponential decay of the correlations over channel uses (modes). This model allows us to characterize the asymptotic behavior of the channel for classical information transmission.
We study effects of imperfections induced by residual couplings between qubits on the accuracy of Shor's algorithm using numerical simulations of realistic quantum computations with up to 30 qubits. The factoring of numbers up to N=943 show that the width of peaks, which frequencies allow to determine the factors, grow exponentially with the number of qubits. However, the algorithm remains operational up to a critical coupling strength $ε_c$ which drops only polynomially with $\log_2 N$. The numerical dependence of $ε_c$ on $\log_2 N$ is explained by analytical estimates that allows to obtain …
Approximation theorems for fermionic Gaussian states
Perimeter Institute for Theoretical Physics（Perimeter理论物理研究所）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Department of Physics, University of Helsinki（赫尔辛基大学物理系）；HUN-REN Wigner Research Centre for Physics（匈牙利研究与创新网络维格纳物理研究中心）；Algorithmiq Ltd（Algorithmiq有限公司）；Center for Theoretical Physics – a Leinweber Institute, Massachusetts Institute of Technology（麻省理工学院莱因韦伯理论物理中心）；Leinweber Institute for Theoretical Physics, Stanford University（斯坦福大学莱因韦伯理论物理研究所）；Google DeepMind（谷歌DeepMind）；Helmholtz-Zentrum Berlin für Materialien und Energie（柏林亥姆霍兹材料与能源中心）
Real life quantum computers are inevitably affected by intrinsic noise resulting in dissipative non-unitary dynamics realized by these devices. We consider an open system quantum annealing algorithm optimized for a realistic analog quantum device which takes advantage of noise-induced thermalization and relies on incoherent quantum tunneling at finite temperature. We analyze the performance of this algorithm considering a p-spin model which allows for a mean field quasicalssical solution and at the same time demonstrates the 1st order phase transition and exponential degeneracy of states. We d…
Though the classical treatment of spontaneous decay leads to an exponential decay law, it is well known that this is an approximation of the quantum mechanical result which is a non-exponential at very small and large times for narrow states. The non exponential nature at large times is however hard to establish from experiments. A method to recover the time evolution of unstable states from a parametrization of the amplitude fitted to data is presented. We apply the method to a realistic example of a very broad state, the sigma meson and reveal that an exponential decay is not a valid approxi…
In one dimension (1D), a general decaying long-range interaction can be fit to a sum of exponential interactions $e^{-λr_{ij}}$ with varying exponents $λ$, each of which can be represented by a simple matrix product operator (MPO) with bond dimension $D=3$. Using this technique, efficient and accurate simulations of 1D quantum systems with long-range interactions can be performed using matrix product states (MPS). However, the extension of this construction to higher dimensions is not obvious. We report how to generalize the exponential basis to 2D and 3D by defining the basis functions as the…
