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

arXiv:2404.02844 · Quantum Science and Technology

Scalable quantum detector tomography by high-performance computing

Timon Schapeler, Robert Schade, Michael Lass, Christian Plessl, Tim J. Bartley

Published Oct 9, 2024• 2 citations
arXivHTMLPDF

Abstract

Abstract At large scales, quantum systems may become advantageous over their classical counterparts at performing certain tasks. Developing tools to analyze these systems at the relevant scales, in a manner consistent with quantum mechanics, is therefore critical to benchmarking performance and characterizing their operation. While classical computational approaches cannot perform like-for-like computations of quantum systems beyond a certain scale, classical high-performance computing (HPC) may nevertheless be useful for precisely these characterization and certification tasks. By developing open-source customized algorithms using HPC, we perform quantum tomography on a megascale quantum photonic detector covering a Hilbert space of 106. This requires finding 108 elements of the matrix corresponding to the positive operator valued measure, the quantum description of the detector, and is achieved in minutes of computation time. Moreover, by exploiting the structure of the problem, we achieve highly efficient parallel scaling, paving the way for quantum objects up to a system size of 1012 elements to be reconstructed using this method. In general, this shows that a consistent quantum mechanical description of quantum phenomena is applicable at everyday scales. More concretely, this enables the reconstruction of large-scale quantum sources, processes and detectors used in computation and sampling tasks, which may be necessary to prove their nonclassical character or quantum computational advantage.

DOI
10.1088/2058-9565/ad8511

Related papers

Approaching Mega-Scale Quantum Detector Tomography using High-Performance Computing

Timon Schapeler, Michael Lass, Christian Plessl +1 more

Quantum characterization tools must keep up with the ever-increasing size of detector arrays for quantum applications. We show quantum detector tomography per-formed on a supercomputer which reconstructs the POVMs up to 2.5 · 105 photons.

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

Efficient Tomography of Microwave Photonic Cluster States

Yoshiki Sunada, Shingo Kono, Jesper Ilves +6 more

Entanglement among a large number of qubits is a crucial resource for many quantum algorithms. Such many-body states have been efficiently generated by entangling a chain of itinerant photonic qubits in the optical or microwave domain. However, it has remained challenging to fully characterize the generated many-body states by experimentally reconstructing their exponentially large density matrices. Here, we develop an efficient tomography method based on the matrix-product-operator formalism and demonstrate it on a cluster state of up to 35 microwave photonic qubits by reconstructing its 2 35 × 2 35 density matrix. The full characterization enables us to detect the performance degradation of our photon source which occurs only when generating a large cluster state. This tomography method is generally applicable to various physical realizations of entangled qubits and provides an efficient benchmarking method for guiding the development of high-fidelity sources of entangled photons.

arXiv:2410.03345•PRX Quantum•Oct 10, 2025•9 citations

Macroscopic photon counting beating the Poisson noise limit

Timon Schapeler, Fabian Schlue, Isabell Mischke +4 more

Photon counting is a cornerstone of quantum optics. Here, we demonstrate precisely counting from 0 to over 9000 photons, beating the Poisson noise limit by at least $4.1~\mathrm{dB}$ across this range. We achieve sub-single-photon precision up to 276 photons per pulse. To do so, we multiplex eight intrinsically photon-number-resolving superconducting nanowire single-photon detectors across 128 temporal modes. We use a model-informed characterization of each of the 1024 detection bins, for optimal precision. We perform quantum detector tomography to reconstruct the positive operator valued measures (POVMs) of the complete device, which consists of $1.38\cdot10^8$ matrix elements. At the repetition rate of our experiment of $80~\mathrm{kHz}$, we can precisely count photons corresponding to an optical power of approximately $71~\mathrm{pW}$, bridging the gap from single-photon measurements to high-sensitivity optical power meters. A photon-number-resolving detector of this size, and the tools used to analyze it, will become increasingly important to characterize large quantum states, as well as tasks in precision metrology and optical power standards.

quant-pharXiv:2604.27761•Optica•May 1, 2026•1 citation

Methods for parallel quantum circuit synthesis, fault-tolerant quantum RAM, and quantum state tomography

Olivia Di Matteo

The pace of innovation in quantum information science has recently exploded due to the hope that a quantum computer will be able to solve a multitude of problems that are intractable using classical hardware. Current quantum devices are in what has been termed the ``noisy intermediate-scale quantum'', or NISQ stage. Quantum hardware available today with 50-100 physical qubits may be among the first to demonstrate a quantum advantage. However, there are many challenges to overcome, such as dealing with noise, lowering error rates, improving coherence times, and scalability. \n \nWe are at a time in the field where minimization of resources is critical so that we can run our algorithms sooner rather than later. Running quantum algorithms ``at scale'' incurs a massive amount of resources, from the number of qubits required to the circuit depth. A large amount of this is due to the need to implement operations fault-tolerantly using error-correcting codes. \n \nFor one, to run an algorithm we must be able to efficiently read in and output data. Fault-tolerantly implementing quantum memories may become an input bottleneck for quantum algorithms, including many which would otherwise yield massive improvements in algorithm complexity. We will also need efficient methods for tomography to characterize and verify our processes and outputs. Researchers will require tools to automate the design of large quantum algorithms, to compile, optimize, and verify their circuits, and to do so in a way that minimizes operations that are expensive in a fault-tolerant setting. Finally, we will also need overarching frameworks to characterize the resource requirements themselves. Such tools must be easily adaptable to new developments in the field, and allow users to explore tradeoffs between their parameters of interest. \n \nThis thesis contains three contributions to this effort: improving circuit synthesis using large-scale parallelization; designing circuits for quantum random-access memories and analyzing various time/space tradeoffs; using the mathematical structure of discrete phase space to select subsets of tomographic measurements. For each topic the theoretical work is supplemented by a software package intended to allow others researchers to easily verify, use, and expand upon the techniques herein.

•Jan 18, 2019•4 citations

ADVANCEMENTS IN QUANTUM COMPUTING: EXPLORING THE POTENTIAL OF QUANTUM ALGORITHMS FOR SOLVING COMPLEX PROBLEMS IN PHYSICS

Hamza Farid, Amina Siddiq

Quantum computing has emerged as a promising paradigm for addressing computational challenges in physics that remain intractable for classical methods. This study presents a quantitative benchmarking analysis of prominent quantum algorithms applied to representative physics problem classes, with the objective of evaluating their computational performance relative to state-of-the-art classical algorithms. Using standardized performance metrics—including execution time, algorithmic complexity, resource utilization, accuracy, scalability, and quantum advantage ratios—the study systematically compares quantum and classical approaches across multiple experimental configurations. The results demonstrate that quantum algorithms exhibit measurable performance gains for specific problem types, particularly in terms of runtime efficiency and scaling behavior, while also highlighting practical constraints related to qubit requirements and circuit depth. Visual and tabulated analyses further reveal that quantum advantage is highly problem-dependent and influenced by algorithmic structure and system size. Overall, the findings provide empirical evidence that quantum algorithms can offer substantial computational benefits for selected physics applications, while underscoring the importance of quantitative benchmarking in distinguishing theoretical promise from practical performance. This work contributes to ongoing efforts to objectively assess quantum advantage and informs future research directions in quantum algorithm development and physics-based applications.

Innovations in Science, Technology, and Society•Dec 31, 2025•0 citations

Tomography and its role in Quantum Computation

William J. Munro, Daniel F. V. James, Andrew G. White +1 more

Quantum computation depends on quantum entanglement, a correlation between subsystems that cannot occur classically. A variety of theoretical measures exist for quantifying the degree entanglement in such schemes, all of which are functions of the system density matrix. How can the entanglement be measured experimentally? Using quantum tomography techniques developed for two photon entangled states, the density matrix can be reconstructed from the appropriate experimental data. In this case the state tomography gives the complete characterization of the physical system (for the relevant degree of freedom, such as spin or polarization). It gives information on both the degree of nonclassical correlation, that is entanglement, as well as the amount of decoherence in the system. In this proceedings we discuss the general state tomography procedure required to characterize a few qubit quantum computer, for any architecture.

•Mar 21, 2001•3 citations
Abstract At large scales, quantum systems may become advantageous over their classical counterparts at performing certain tasks. Developing tools to analyze these systems at the relevant scales, in a manner consistent with quantum mechanics, is therefore critical to benchmarking performance and characterizing their operation. While classical computational approaches cannot perform like-for-like computations of quantum systems beyond a certain scale, classical high-performance computing (HPC) may nevertheless be useful for precisely these characterization and certification tasks. By developing open-source customized algorithms using HPC, we perform quantum tomography on a megascale quantum photonic detector covering a Hilbert space of 106. This requires finding 108 elements of the matrix corresponding to the positive operator valued measure, the quantum description of the detector, and is achieved in minutes of computation time. Moreover, by exploiting the structure of the problem, we achieve highly efficient parallel scaling, paving the way for quantum objects up to a system size of 1012 elements to be reconstructed using this method. In general, this shows that a consistent quantum mechanical description of quantum phenomena is applicable at everyday scales. More concretely, this enables the reconstruction of large-scale quantum sources, processes and detectors used in computation and sampling tasks, which may be necessary to prove their nonclassical character or quantum computational advantage.
Entanglement among a large number of qubits is a crucial resource for many quantum algorithms. Such many-body states have been efficiently generated by entangling a chain of itinerant photonic qubits in the optical or microwave domain. However, it has remained challenging to fully characterize the generated many-body states by experimentally reconstructing their exponentially large density matrices. Here, we develop an efficient tomography method based on the matrix-product-operator formalism and demonstrate it on a cluster state of up to 35 microwave photonic qubits by reconstructing its 2 35 × 2 35 density matrix. The full characterization enables us to detect the performance degradation of our photon source which occurs only when generating a large cluster state. This tomography method is generally applicable to various physical realizations of entangled qubits and provides an efficient benchmarking method for guiding the development of high-fidelity sources of entangled photons.
Photon counting is a cornerstone of quantum optics. Here, we demonstrate precisely counting from 0 to over 9000 photons, beating the Poisson noise limit by at least 4.1 dB4.1~\mathrm{dB}4.1 dB across this range. We achieve sub-single-photon precision up to 276 photons per pulse. To do so, we multiplex eight intrinsically photon-number-resolving superconducting nanowire single-photon detectors across 128 temporal modes. We use a model-informed characterization of each of the 1024 detection bins, for optimal precision. We perform quantum detector tomography to reconstruct the positive operator valued measures (POVMs) of the complete device, which consists of 1.38⋅1081.38\cdot10^81.38⋅108 matrix elements. At the repetition rate of our experiment of 80 kHz80~\mathrm{kHz}80 kHz, we can precisely count photons corresponding to an optical power of approximately 71 pW71~\mathrm{pW}71 pW, bridging the gap from single-photon measurements to high-sensitivity optical power meters. A photon-number-resolving detector of this size, and the tools used to analyze it, will become increasingly important to characterize large quantum states, as well as tasks in precision metrology and optical power standards.
The pace of innovation in quantum information science has recently exploded due to the hope that a quantum computer will be able to solve a multitude of problems that are intractable using classical hardware. Current quantum devices are in what has been termed the ``noisy intermediate-scale quantum'', or NISQ stage. Quantum hardware available today with 50-100 physical qubits may be among the first to demonstrate a quantum advantage. However, there are many challenges to overcome, such as dealing with noise, lowering error rates, improving coherence times, and scalability. \n \nWe are at a time in the field where minimization of resources is critical so that we can run our algorithms sooner rather than later. Running quantum algorithms ``at scale'' incurs a massive amount of resources, from the number of qubits required to the circuit depth. A large amount of this is due to the need to implement operations fault-tolerantly using error-correcting codes. \n \nFor one, to run an algorithm we must be able to efficiently read in and output data. Fault-tolerantly implementing quantum memories may become an input bottleneck for quantum algorithms, including many which would otherwise yield massive improvements in algorithm complexity. We will also need efficient methods for tomography to characterize and verify our processes and outputs. Researchers will require tools to automate the design of large quantum algorithms, to compile, optimize, and verify their circuits, and to do so in a way that minimizes operations that are expensive in a fault-tolerant setting. Finally, we will also need overarching frameworks to characterize the resource requirements themselves. Such tools must be easily adaptable to new developments in the field, and allow users to explore tradeoffs between their parameters of interest. \n \nThis thesis contains three contributions to this effort: improving circuit synthesis using large-scale parallelization; designing circuits for quantum random-access memories and analyzing various time/space tradeoffs; using the mathematical structure of discrete phase space to select subsets of tomographic measurements. For each topic the theoretical work is supplemented by a software package intended to allow others researchers to easily verify, use, and expand upon the techniques herein.
Quantum computing has emerged as a promising paradigm for addressing computational challenges in physics that remain intractable for classical methods. This study presents a quantitative benchmarking analysis of prominent quantum algorithms applied to representative physics problem classes, with the objective of evaluating their computational performance relative to state-of-the-art classical algorithms. Using standardized performance metrics—including execution time, algorithmic complexity, resource utilization, accuracy, scalability, and quantum advantage ratios—the study systematically compares quantum and classical approaches across multiple experimental configurations. The results demonstrate that quantum algorithms exhibit measurable performance gains for specific problem types, particularly in terms of runtime efficiency and scaling behavior, while also highlighting practical constraints related to qubit requirements and circuit depth. Visual and tabulated analyses further reveal that quantum advantage is highly problem-dependent and influenced by algorithmic structure and system size. Overall, the findings provide empirical evidence that quantum algorithms can offer substantial computational benefits for selected physics applications, while underscoring the importance of quantitative benchmarking in distinguishing theoretical promise from practical performance. This work contributes to ongoing efforts to objectively assess quantum advantage and informs future research directions in quantum algorithm development and physics-based applications.
Quantum computation depends on quantum entanglement, a correlation between subsystems that cannot occur classically. A variety of theoretical measures exist for quantifying the degree entanglement in such schemes, all of which are functions of the system density matrix. How can the entanglement be measured experimentally? Using quantum tomography techniques developed for two photon entangled states, the density matrix can be reconstructed from the appropriate experimental data. In this case the state tomography gives the complete characterization of the physical system (for the relevant degree of freedom, such as spin or polarization). It gives information on both the degree of nonclassical correlation, that is entanglement, as well as the amount of decoherence in the system. In this proceedings we discuss the general state tomography procedure required to characterize a few qubit quantum computer, for any architecture.