Quantum Information and Measurement (QIM)

Verifying Multi-Particle Entanglement with a Few Detection Events

Valeria Saggio, Aleksandra Dimić, Chiara Greganti, Lee A. Rozema, Philip John Walther, Borivoje Dakić

Published Jan 1, 2019• 0 citations

Abstract

Entanglement verification becomes hard when dealing with large quantum systems. By treating this task probabilistically, we certify entanglement with high confidence in an experimental photonic six-qubit cluster state by using only a few detection events.

DOI: 10.1364/qim.2019.f5a.7

Related papers

Verifying Multi-Partite Entanglement with a Few Detection Events

Lee A. Rozema, Valeria Saggio, Aleksandra Dimić +3 more

We introduce a new entanglement-verification method and use it to experimentally verify the entanglement in a photonic six-qubit cluster state, created at telecommunication wavelengths, by detecting only 20 copies of the quantum state.

Conference on Lasers and Electro-OpticsJan 1, 20190 citations

Verifying Multi-Partite Entanglement with a Few Detection Events

Lee A. Rozema, Valeria Saggio, Aleksandra Dimić +3 more

Conference on Lasers and Electro-OpticsMay 5, 20190 citations

Experimental Resource-Efficient Entanglement Detection

Valeria Saggio, Aleksandra Dimić, Chiara Greganti +3 more

A new entanglement-verification method is introduced and experimentally verified with a six-photon cluster state. We demonstrate that it is possible to efficiently detect multipartite entanglement with only a few copies of the state.

Conference on Lasers and Electro-OpticsJan 1, 20200 citations

Single-copy entanglement detection

Aleksandra Dimić, Borivoje Dakić

Abstract One of the main challenges of quantum information is the reliable verification of quantum entanglement. The conventional detection schemes require repeated measurement on a large number of identically prepared systems. This is hard to achieve in practice when dealing with large-scale entangled quantum systems. In this letter we formulate verification as a decision procedure, i.e., entanglement is seen as the ability of quantum system to answer certain “yes-no questions”. We show that for a variety of large quantum states even a single copy suffices to detect entanglement with a high probability by using local measurements. For example, a single copy of a 16-qubit k-producible state or one copy of 24-qubit linear cluster state suffices to verify entanglement with more than 95% confidence. Our method is applicable to many important classes of states, such as cluster states or ground states of local Hamiltonians in general.

arXiv:1705.06719npj Quantum InformationFeb 6, 201857 citations

Detection of quantum correlations

Aleksandra Dimić

One of the main foci of modern applied quantum information theory\nis the production of large-scale quantum entanglement involving many\nparticles, to achieve the next-generation quantum technologies. Although a full-scale quantum computer is still far away in time, in the next\nfew years we can expect to have quantum devices composed of up to a\nhundred controllable qubits. The primary challenge in moving towards\nsuch devices lies in the development of reliable and resource-efficient\ndetection techniques to prove genuine quantum advantage. The main\nobjective of this thesis is to investigate novel methods to detect the presence of quantum correlations in such systems, in particular, quantum\nentanglement and quantum nonlocality.\nThe first part of this thesis is dedicated to entanglement detection\nin large-scale quantum systems. Our main goal is to develop a novel\nprobabilistic method in which entanglement is seen as an ability of a\nquantum system to accomplish certain information-processing tasks.\nWe show that for certain classes of large (e.g. few tens of qubits) quantum states, even a single copy of a quantum state suffices to detect\nentanglement with a high confidence. Compared to the standard detection methods, this makes our method exceptionally resource-efficient.\nThe developed probabilistic scheme applies to multiple classes of states, vital for quantum computation, such as cluster states or ground\nstates of local Hamiltonians.\nIn the second part of this thesis, we develop a generic framework\nfor translating any entanglement witness into a resource-efficient probabilistic scheme. We show that the confidence level of entanglement\ndetection grows exponentially fast with the number of detection events,\nwhich makes this ansatz very efficient and reliable. Furthermore, we\npresent the first experimental performance of our method by verifying\nthe presence of entanglement in a photonic six-qubit cluster state.\nThe third part of this thesis describes the extension of our entanglement verification method to quantum nonlocality. Concrete examples\nare presented where we convert Bell’s inequalities into the probabilistic\nprocedure and incorporate our method into self-testing schemes. We\nshow that the performance of our method significantly exceeds the ability of the existing methods for detection of quantum nonlocality and\nself-testing.\nThe last part of this thesis is a study of the weak-convergence properties of random variables generated by quantum measurements. Beginning with a sequence of random variables generated by repeated\nunsharp quantum measurements, we study the limit distribution of\nmeasured relative frequency. We provide the de Finetti-type of representation theorem for all separable states, showing that the measured\ndistribution can be well approximated by a mixture of normal distributions. Additionally, we investigate the convergence rates and show\nthat the relative frequency converges to some constant at the rate of\norder 1=pN for all separable inputs. Finally, we provide an example of\na strictly unsharp quantum measurement where we obtain better scaling by using entangled inputs. We find such behaviour of entangled\nstates relevant for quantum information processing.

Sep 13, 20190 citations

A perspective on few-copy entanglement detection in experiments

Valeria Saggio, Philip John Walther

Although the realization of useful quantum computers poses significant challenges, swift progress in emerging quantum technologies is making this goal realistically approachable. In this context, one of the essential resources is quantum entanglement, which allows for quantum computations outperforming their classical counterparts. However, the task of entanglement detection is not always straightforward for several reasons. One of the main challenges is that standardly-used methods rapidly become unfeasible when dealing with quantum states containing more than a few qubits. Typically, this is due to the fact that a vast amount of measurements is needed on many copies of the state. Generally, it is not unusual to deal with a very limited number of state copies in experimental settings - in fact, this may be the case for many large quantum systems. In this article, an overview is provided of a probabilistic approach that enables high-confidence genuine multipartite entanglement detection using an exceptionally low number of state copies. Additionally, a study is presented that shows that this protocol remains efficient also in the presence of noise, thus confirming the practicality of the method for near-term quantum devices and its suitability for complex experimental settings.

arXiv:2201.02641Jan 7, 20222 citations