Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)

A Multi-Copy Approach to Quantum Entanglement Characterization

Radim Hošák, Robert Stárek, Radim Filip, Miroslav Ježek

Published Jun 1, 2019• 0 citations
Publisher

Abstract

An accurate evaluation of the performance of quantum entanglement sources-based on various physical realizations and designed for application in numerous quantum protocols-requires a thorough characterization of the ensemble of the generated output quantum states. This presents a great challenge, as numerous measurements, such as full state tomography, need to be performed on the ensemble. This incentivizes us to reduce the overall duration of the characterization procedure, so that time is saved and the effect of setup drift reduced. For many physical realizations of the quantum states, including polarization and path-encoded qubits, a traveling salesman problem of finding the optimal order of tomographic projections can be found and solved [1]. The achieved tomography speedup, found and experimentally verified [2,3] for up to six-qubit systems, is seen to increase with the size of the quantum system in question, see Fig. 1(a). For three-qubit systems already, the time spent on setting the measurement projections can be halved. A step-by-step workflow [4] is introduced to suit various tomographic scenarios.

DOI
10.1109/cleoe-eqec.2019.8873072

Related papers

Efficient non-tomographic tools for the characterization of multipartite entanglement

Witlef Wieczorek, Nikolai Kiesel, Christoph Schmid +1 more

Entanglement is the crucial resource in the field of quantum information processing and consequently a better understanding of its properties is very desirable. While for bipartite entangled qubit states many tools for characterization exist and also the experimental implementation of the tools is feasible, the situation for multipartite entangled states is different: The available tools have to be suited for a much greater diversity of entanglement properties, e.g. to analyze all the different entanglement classes [1]. A full experimental characterization via state tomography is increasingly difficult as the number of necessary measurement settings grows exponentially with the number of particles. In this contribution we focus on efficient, non-tomographic methods to characterize experimentally observed, multipartite entangled states. First steps towards this goal were demonstrated recently, for instance, for the proof of genuine multipartite entanglement [2] or for the analysis of the persistency of entanglement under loss [3]. Such methods can be further optimized by tailoring them to particular properties of states. We show how three important characteristic quantities, the fidelity, the non-separability and the permutation symmetry, can be evaluated with a significantly lower number of measurement settings than required for a complete tomography. Although the determination of these particular properties provides less information than the reconstruction of the complete density matrix, it allows to judge how well state characteristics are reproduced experimentally. This might be important with respect to an experimental application of states in quantum information. Exemplarily we apply the analysis tools to two genuinely four-qubit entangled states: the Dicke state with two excitations |D 4 〉 [4] and the cluster state |C4 〉 [5, 6]. These states are relevant for particular tasks: The state |D 4 〉 is a resource for telecloning [7], cluster states find an application in one-way quantum computation [6, 8] and are a subgroup of graph states, which play an important role for quantum error correction.

•Jan 1, 2007•0 citations

Quantum Measurement on a Budget

Dylan H. Mahler

Quantum computation - the use of quantum systems as bits, or qubits, to perform computation - has been proven to be exponentially faster than what is thought possible with classical computation for several tasks. Quantum computers have the unique ability to store an amount of information that is exponential in the number of constituent particles used to encode that information. This property, which is arguably where quantum computers derive their power, makes it very difficult to characterize quantum systems. In order to fully characterize an unknown quantum state, a series of measurements must be performed on it and the state deduced from the results of those measurements. This process, called quantum tomography, is known to require exponential resources in the number of qubits. Both the number of measurements - the measurement complexity - and the number of times each measurement must be repeated - the sample complexity - present serious challenges when performing tomography. In addition, the measurement apparatus itself, which is usually a quantum system, must be characterized leading to even more experimental complexity. Here, I present three experiments which aim to reduce the experimental complexity of quantum tomography. The first aims to reduce the number of measurements needed to locate the decoherence-free subspaces of a noisy quantum channel. The process of locating these subspaces, which would normally require full process tomography, is performed with quadratically fewer measurement settings. The second experiment aims to characterize both an uncalibrated measurement apparatus and an unknown quantum state at the same time. With a specific model of measurement, it is found that an uncalibrated parameter of the measurement can be directly extracted using a single measurement. In the third experiment, I perform an experiment in which the optimal sample complexity for quantum state tomography is obtained using adaptivity: the ability to change measurement settings part way through an experiment. All three experiments were performed using the polarization degree of freedom of photons generated by spontaneous parametric downconversion. The source of photon pairs and the measurement techniques used are described in detail, along with the theory of quantum distinguishability and its relevance to tomography.

•Jun 1, 2015•0 citations

The minimum-error quantum estimation through noisy multi-projector measurement

Martin Bielak, Dominik Koutný, Michal Neset +1 more

Full quantum state characterization requires a tomographic procedure performed on a limited number of copies. Our experimental demonstration of one- and two-qubit overcomplete tomographic measurements (up to 400 separable projections) outper-forms state-of-the-art approaches.

Quantum 2.0 Conference and Exhibition•Jan 1, 2024•0 citations

The minimum-error quantum estimation with multi-projector measurements

Martin Bielak, Dominik Koutný, Michal Neset +1 more

Full quantum state characterization requires a tomographic procedure performed on a limited number of copies. Our experimental demonstration of one- and two-qubit overcomplete tomographic measurements (up to 400 separable projections) outperforms state-of-the-art approaches, showcasing significant error reduction.

Conference on Lasers and Electro-Optics•Jan 1, 2024•0 citations

Optimal reordering of measurements for photonic quantum tomography

Radim Hošák, Robert Stárek, Miroslav Ježek

Quantum tomography is an essential method of the photonic technology toolbox and is routinely used for evaluation of experimentally prepared states of light and characterization of devices transforming such states. The tomography procedure consists of many different sequentially performed measurements. We present considerable tomography speedup by optimally arranging the individual constituent measurements, which is equivalent to solving an instance of the traveling salesman problem. As an example, we obtain solutions for photonic systems of up to five qubits, and conclude that already for systems of three or more qubits, the total duration of the tomography procedure can be halved. The reported speedup has been verified experimentally for quantum state tomography and also for full quantum process characterization up to six qubits, without resorting to any complexity reduction or simplification of the system of interest. Our approach is versatile and reduces the time of an input-output characterization of optical devices and various scattering processes as well.

arXiv:1809.07521•Optics Express•Nov 30, 2018•3 citations

Solving the travelling salesman problem using Bloch sphere encoding

Kapil Goswami, Gagan Anekonda Veereshi, Peter Schmelcher +1 more

Abstract The travelling salesman problem (TSP) is a popular NP-hard combinatorial optimization problem that requires finding the optimal way for a salesman to travel through different cities once and return to the initial city. The existing methods of solving TSPs on quantum systems are either gate-based or binary variable-based encoding. Both approaches are resource-expensive in terms of the number of qubits, while performing worse compared to existing classical algorithms, even for small-sized problems. A novel encoding scheme is needed to map the TSP problem onto a quantum system, which is addressed in this work. We introduce a distinct geometric approach to encode the TSP on a single qubit and present a quantum-inspired algorithm to solve the problem by invoking the principle of quantum superposition . The cities are represented as quantum states on the Bloch sphere, while the preparation of superposition states allows us to traverse multiple paths at once. The underlying framework of our algorithm is a quantum-inspired version of the classical Brachistochrone approach. Optimal control methods are employed to create a selective superposition of the quantum states to find the shortest route of a given TSP. The numerical simulations solve a sample of four to nine cities for which exact solutions are obtained. The algorithm can be implemented on any quantum platform capable of efficiently rotating a qubit and allowing state tomography measurements. For the TSP problem sizes considered in this work, our algorithm is more resource-efficient and accurate than existing quantum algorithms, with the potential for scalability.

arXiv:2407.17207•Quantum Science and Technology•Nov 12, 2025•14 citations
An accurate evaluation of the performance of quantum entanglement sources-based on various physical realizations and designed for application in numerous quantum protocols-requires a thorough characterization of the ensemble of the generated output quantum states. This presents a great challenge, as numerous measurements, such as full state tomography, need to be performed on the ensemble. This incentivizes us to reduce the overall duration of the characterization procedure, so that time is saved and the effect of setup drift reduced. For many physical realizations of the quantum states, including polarization and path-encoded qubits, a traveling salesman problem of finding the optimal order of tomographic projections can be found and solved [1]. The achieved tomography speedup, found and experimentally verified [2,3] for up to six-qubit systems, is seen to increase with the size of the quantum system in question, see Fig. 1(a). For three-qubit systems already, the time spent on setting the measurement projections can be halved. A step-by-step workflow [4] is introduced to suit various tomographic scenarios.
Entanglement is the crucial resource in the field of quantum information processing and consequently a better understanding of its properties is very desirable. While for bipartite entangled qubit states many tools for characterization exist and also the experimental implementation of the tools is feasible, the situation for multipartite entangled states is different: The available tools have to be suited for a much greater diversity of entanglement properties, e.g. to analyze all the different entanglement classes [1]. A full experimental characterization via state tomography is increasingly difficult as the number of necessary measurement settings grows exponentially with the number of particles. In this contribution we focus on efficient, non-tomographic methods to characterize experimentally observed, multipartite entangled states. First steps towards this goal were demonstrated recently, for instance, for the proof of genuine multipartite entanglement [2] or for the analysis of the persistency of entanglement under loss [3]. Such methods can be further optimized by tailoring them to particular properties of states. We show how three important characteristic quantities, the fidelity, the non-separability and the permutation symmetry, can be evaluated with a significantly lower number of measurement settings than required for a complete tomography. Although the determination of these particular properties provides less information than the reconstruction of the complete density matrix, it allows to judge how well state characteristics are reproduced experimentally. This might be important with respect to an experimental application of states in quantum information. Exemplarily we apply the analysis tools to two genuinely four-qubit entangled states: the Dicke state with two excitations |D 4 〉 [4] and the cluster state |C4 〉 [5, 6]. These states are relevant for particular tasks: The state |D 4 〉 is a resource for telecloning [7], cluster states find an application in one-way quantum computation [6, 8] and are a subgroup of graph states, which play an important role for quantum error correction.
Quantum computation - the use of quantum systems as bits, or qubits, to perform computation - has been proven to be exponentially faster than what is thought possible with classical computation for several tasks. Quantum computers have the unique ability to store an amount of information that is exponential in the number of constituent particles used to encode that information. This property, which is arguably where quantum computers derive their power, makes it very difficult to characterize quantum systems. In order to fully characterize an unknown quantum state, a series of measurements must be performed on it and the state deduced from the results of those measurements. This process, called quantum tomography, is known to require exponential resources in the number of qubits. Both the number of measurements - the measurement complexity - and the number of times each measurement must be repeated - the sample complexity - present serious challenges when performing tomography. In addition, the measurement apparatus itself, which is usually a quantum system, must be characterized leading to even more experimental complexity. Here, I present three experiments which aim to reduce the experimental complexity of quantum tomography. The first aims to reduce the number of measurements needed to locate the decoherence-free subspaces of a noisy quantum channel. The process of locating these subspaces, which would normally require full process tomography, is performed with quadratically fewer measurement settings. The second experiment aims to characterize both an uncalibrated measurement apparatus and an unknown quantum state at the same time. With a specific model of measurement, it is found that an uncalibrated parameter of the measurement can be directly extracted using a single measurement. In the third experiment, I perform an experiment in which the optimal sample complexity for quantum state tomography is obtained using adaptivity: the ability to change measurement settings part way through an experiment. All three experiments were performed using the polarization degree of freedom of photons generated by spontaneous parametric downconversion. The source of photon pairs and the measurement techniques used are described in detail, along with the theory of quantum distinguishability and its relevance to tomography.
Quantum tomography is an essential method of the photonic technology toolbox and is routinely used for evaluation of experimentally prepared states of light and characterization of devices transforming such states. The tomography procedure consists of many different sequentially performed measurements. We present considerable tomography speedup by optimally arranging the individual constituent measurements, which is equivalent to solving an instance of the traveling salesman problem. As an example, we obtain solutions for photonic systems of up to five qubits, and conclude that already for systems of three or more qubits, the total duration of the tomography procedure can be halved. The reported speedup has been verified experimentally for quantum state tomography and also for full quantum process characterization up to six qubits, without resorting to any complexity reduction or simplification of the system of interest. Our approach is versatile and reduces the time of an input-output characterization of optical devices and various scattering processes as well.
Abstract The travelling salesman problem (TSP) is a popular NP-hard combinatorial optimization problem that requires finding the optimal way for a salesman to travel through different cities once and return to the initial city. The existing methods of solving TSPs on quantum systems are either gate-based or binary variable-based encoding. Both approaches are resource-expensive in terms of the number of qubits, while performing worse compared to existing classical algorithms, even for small-sized problems. A novel encoding scheme is needed to map the TSP problem onto a quantum system, which is addressed in this work. We introduce a distinct geometric approach to encode the TSP on a single qubit and present a quantum-inspired algorithm to solve the problem by invoking the principle of quantum superposition . The cities are represented as quantum states on the Bloch sphere, while the preparation of superposition states allows us to traverse multiple paths at once. The underlying framework of our algorithm is a quantum-inspired version of the classical Brachistochrone approach. Optimal control methods are employed to create a selective superposition of the quantum states to find the shortest route of a given TSP. The numerical simulations solve a sample of four to nine cities for which exact solutions are obtained. The algorithm can be implemented on any quantum platform capable of efficiently rotating a qubit and allowing state tomography measurements. For the TSP problem sizes considered in this work, our algorithm is more resource-efficient and accurate than existing quantum algorithms, with the potential for scalability.