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

Resources in Quantum Technology: Applications in quantum tomography and clock synchronization

Mark D. de Burgh

Published Feb 1, 2011• 0 citations
OpenAlex

Abstract

Quantum technologies in the areas of metrology, cryptography and computation, both theoretical and practical, are exceeding the limits that are classically possible, and even approaching the ultimate quantum limits. Despite rapid advances, experimental implementation of these technologies remains limited to small systems. The key question of this thesis is whether, through the use of alternate resources, quantum technologies can be brought closer to experimental feasibility. We investigate two application areas: quantum tomography, the experimental characterization of a quantum state or processes and quantum clock synchronization. Quantum tomography is fundamental to all quantum technologies, yet experimentalists have prepared quantum states that surpass existing characterization techniques. A key result of this dissertation is that popular experimental techniques can be improved through an alternative choice of measurement settings based on the geometry of Platonic solids. The change requires no increased complexity in the experimental apparatus. We also derive a novel numerical technique for reconstructing quantum states and processes from measured data. We frame the problem as a semidefinite program, an optimization problem that may be solved efficiently. We also develop a novel adaptive tomography technique, in which the time spent on each measurement adapts based on previous measurement outcomes. Finally to understand the average performance of different tomography schemes we need a notion of a prior distribution over quantum states. We derive a new prior over quantum states based on a recently derived state distinguishability measure, the quantum Chernoff bound. The best classical algorithms to synchronize clocks achieve the so called standard quantum limit. Quantum clock synchronization protocols have already surpassed this limit and theoretical proposals even reach the ultimate Heisenberg limit. However, these protocols rely on a resource known as entanglement, limiting their current feasibility. We develop a novel quantum clock synchronization protocol with performance close to the Heisenberg limit yet requiring no entanglement. We also develop an optical proof of principle realization of the clock synchronization scheme that requires only existing experimental apparatus.

Related papers

Algorithms and protocols for quantum information technologies

Robert J. Chapman

Quantum technologies harness the properties of controlled quantum mechanical systems for applications in computation, communication and metrology, and enable us to further our understanding of fundamental physics. Quantum hardware is designed to manipulate complex and fragile many-particle quantum states, which requires exquisite control machinery, advanced software and near-complete isolation from the surrounding environment. With sufficient capabilities, quantum computers with large registers of quantum bits will perform classically intractable calculations such as quantum chemistry simulations. Quantum key distribution will provide completely secure communications across the world and quantum metrology will enable measurement precision beyond today's capabilities. While quantum technologies are far from surpassing classical hardware today, the vision and potential impact has sparked a world-wide research effort, both theoretical and experimental, to develop a quantum computer. The most sophisticated current quantum technologies have control over small numbers of quantum bits and are limited by environmental decoherence processes. While progress in developing quantum hardware is ongoing, designing and demonstrating new algorithms and protocols for quantum information is a thriving research field. Photonics provides an ideal platform for small-scale proof-of-concept quantum experiments, which are the focus of this thesis. In the coming decades, we will see the realisation of quantum hardware capable of applications that outperform any classical computer. In this thesis, I present several protocols and algorithms for quantum information science and technology, which are implemented in quantum photonic experiments. The applications of these works include robust quantum tomography, quantum state relocation, quantum enhanced data recovery and probing fundamental causality in quantum mechanics. The works presented here are based on two photon experiments from a prototypical spontaneous parametric down-conversion source, which provides an excellent test-bed for quantum information experiments. Photons can be used to encode quantum information in a range of different degrees of freedom. This versatility, along with compatibility with existing technology gives photonics a great advantage in the development of quantum hardware.

•Feb 13, 2018•0 citations

Some Theory and Applications of Probability in Quantum Mechanics

Christopher Ferrie

This thesis investigates three distinct facets of the theory of quantum information. The first two, quantum state estimation and quantum process estimation, are closely related and deal with the question of how to estimate the classical parameters in a quantum mechanical model. The third attempts to bring quantum theory as close as possible to classical theory through the formalism of quasi-probability. \n \nBuilding a large scale quantum information processor is a significant challenge. First, we require an accurate characterization of the dynamics experienced by the device to allow for the application of error correcting codes and other tools for implementing useful quantum algorithms. The necessary scaling of computational resources needed to characterize a quantum system as a function of the number of subsystems is by now a well studied problem (the scaling is generally exponential). However, irrespective of the computational resources necessary to just write-down a classical description of a quantum state, we can ask about the experimental resources necessary to obtain data (measurement complexity) and the computational resources necessary to generate such a characterization (estimation complexity). These problems are studied here and approached from two directions. \n \nThe first problem we address is that of quantum state estimation. We apply high-level decision theoretic principles (applied in classical problems such as, for example, universal data compression) to the estimation of a qubit state. We prove that quantum states are more difficult to estimate than their classical counterparts by finding optimal estimation strategies. These strategies, requiring the solution to a difficult optimization problem, are difficult to implement in practise. Fortunately, we find estimation algorithms which come close to optimal but require far fewer resources to compute. Finally, we provide a classical analog of this quantum mechanical problem which reproduces, and gives intuitive explanations for, many of its features, such as why adaptive tomography can quadratically reduce its difficulty. \n \nThe second method for practical characterization of quantum devices takes is applied to the problem of quantum process estimation. This differs from the above analysis in two ways: (1) we apply strong restrictions on knowledge of various estimation and control parameters (the former making the problem easier, the latter making it harder); and (2) we consider the problem of designing future experiments based on the outcomes of past experiments. We show in test cases that adaptive protocols can exponentially outperform their off-line counterparts. Moreover, we adapt machine learning algorithms to the problem which bring these experimental design methodologies to realm of experimental feasibility. \n \nIn the final chapter we move away from estimation problems to show formally that a classical representation of quantum theory is not tenable. This intuitive conclusion is formally borne out through the connection to quasi-probability -- where it is equivalent to the necessity of negative probability in all such representations of quantum theory. In particular, we generalize previous no-go theorems to arbitrary classical representations of quantum systems of arbitrary dimension. We also discuss recent progress in the program to identify quantum resources for subtheories of quantum theory and operational restrictions motivated by quantum computation.

•Jul 19, 2012•0 citations

Efficient quantum state analysis and entanglement detection

Lukas Knips

Entanglement is one of the most fascinating features of quantum theory, as it fundamentally distinguishes quantum systems from classical systems. It not only might play a role in natural processes, but provides an especially powerful resource for a plethora of quantum information protocols, including quantum state teleportation, superdense coding as well as quantum computation schemes. However, for larger systems involving more than two parties, it is a challenging task to verify and characterize entanglement. In this thesis, efficient means for detecting genuine multipartite entanglement in multiqubit quantum systems will be derived, demonstrated, and discussed. Beyond that, methods for quantum state and process tomography will be introduced, which allow to analyze and investigate prepared multipartite states or even the performance of whole setups. Some typical obstacles for reliable state tomography will be pointed out, together with new means to understand experimentally obtained data. Finally, the measurement problem, which describes the unavoidable backaction of a measurement process to the quantum state under investigation, will be illustrated. Together with the discussion of different methods of quantum measurements, the optimal measurement instruments for binary qubit measurements will be derived. These optimal measurement instruments allow to perform a quantum measurement, providing a tunable amount of information about the quantum state, while avoiding any unnecessary disturbance to the state. This set of optimal instruments will be compared to other measurement schemes, such as measurements based on the optimal quantum cloning protocol.

•Jan 1, 2019•1 citation

Quantum Information Science and Quantum Metrology: Novel Systems and Applications

P. Kómár

The current frontier of our understanding of the physical universe is dominated by quantum phenomena. Uncovering the prospects and limitations of acquiring and processing information using quantum effects is an outstanding challenge in physical science. This thesis presents an analysis of several new model systems and applications for quantum information processing and metrology.\n\nFirst, we analyze quantum optomechanical systems exhibiting quantum phenomena in both optical and mechanical degrees of freedom. We investigate the strength of non-classical correlations in a model system of two optical and one mechanical mode. We propose and analyze experimental protocols that exploit these correlations for quantum computation.\n\nWe then turn our attention to atom-cavity systems involving strong coupling of atoms with optical photons, and investigate the possibility of using them to store information robustly and as relay nodes. We present a scheme for a robust two-qubit quantum gate with inherent error-detection capabilities. We consider several remote entanglement protocols employing this robust gate, and we use these systems to study the performance of the gate in practical applications.\n\nFinally, we present a new protocol for running multiple, remote atomic clocks in quantum unison. We show that by creating a cascade of independent Greenberger-Horne-Zeilinger states distributed across the network, the scheme asymptotically reaches the Heisenberg limit, the fundamental limit of measurement accuracy. We propose an experimental realization of such a network consisting of neutral atom clocks, and analyze the practical performance of such a system.

•Dec 14, 2015•0 citations

Quantum Clock Synchronization Networks: A Survey

Uman Khalid, Muhammad Shohibul Ulum, Mujirin +3 more

Quantum clock synchronization (QCS) aims to establish a shared temporal reference between distant nodes by exploiting uniquely quantum phenomena such as entanglement, single-photon interference, and quantum correlations. In contrast to classical synchronization and time-transfer techniques, which are limited by signal propagation delays, atmospheric disturbances, and oscillator drift, QCS protocols offer the potential to surpass classical precision bounds and enhance resilience against adversarial manipulations. As precise and secure time synchronization underpins distributed quantum networks, navigation systems, and emerging quantum Internet infrastructures, understanding QCS principles, capabilities, and implementation challenges has become increasingly important. This survey provides a unified and critical overview of the rapidly growing QCS research landscape, highlighting fundamentals, protocol types, enabling resources, performance constraints, security considerations, and practical implementations of QCS. We first introduce the theoretical underpinnings of QCS, including entanglement-assisted time transfer, Hong-Ou-Mandel interference-based synchronization, and quantum slow-clock transport. We then categorize the main QCS protocols, ranging from ticking-qubit and entanglement-based schemes to time-of-arrival correlation methods, conveyor-belt synchronization, and quantum-enhanced two-way time transfer. This organization clarifies the relationships between protocol families and their achievable precision advantages over classical methods. Key quantum resources such as spontaneous parametric down-conversion-based entangled photon pairs, Greenberger-Horne-Zeilinger and W multipartite states, squeezed and frequency-entangled light, quantum frequency combs, and quantum memories are reviewed in the context of scalability and robustness.

quant-pharXiv:2604.04437•Apr 7, 2026•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
Quantum technologies in the areas of metrology, cryptography and computation, both theoretical and practical, are exceeding the limits that are classically possible, and even approaching the ultimate quantum limits. Despite rapid advances, experimental implementation of these technologies remains limited to small systems. The key question of this thesis is whether, through the use of alternate resources, quantum technologies can be brought closer to experimental feasibility. We investigate two application areas: quantum tomography, the experimental characterization of a quantum state or processes and quantum clock synchronization. Quantum tomography is fundamental to all quantum technologies, yet experimentalists have prepared quantum states that surpass existing characterization techniques. A key result of this dissertation is that popular experimental techniques can be improved through an alternative choice of measurement settings based on the geometry of Platonic solids. The change requires no increased complexity in the experimental apparatus. We also derive a novel numerical technique for reconstructing quantum states and processes from measured data. We frame the problem as a semidefinite program, an optimization problem that may be solved efficiently. We also develop a novel adaptive tomography technique, in which the time spent on each measurement adapts based on previous measurement outcomes. Finally to understand the average performance of different tomography schemes we need a notion of a prior distribution over quantum states. We derive a new prior over quantum states based on a recently derived state distinguishability measure, the quantum Chernoff bound. The best classical algorithms to synchronize clocks achieve the so called standard quantum limit. Quantum clock synchronization protocols have already surpassed this limit and theoretical proposals even reach the ultimate Heisenberg limit. However, these protocols rely on a resource known as entanglement, limiting their current feasibility. We develop a novel quantum clock synchronization protocol with performance close to the Heisenberg limit yet requiring no entanglement. We also develop an optical proof of principle realization of the clock synchronization scheme that requires only existing experimental apparatus.
Quantum technologies harness the properties of controlled quantum mechanical systems for applications in computation, communication and metrology, and enable us to further our understanding of fundamental physics. Quantum hardware is designed to manipulate complex and fragile many-particle quantum states, which requires exquisite control machinery, advanced software and near-complete isolation from the surrounding environment. With sufficient capabilities, quantum computers with large registers of quantum bits will perform classically intractable calculations such as quantum chemistry simulations. Quantum key distribution will provide completely secure communications across the world and quantum metrology will enable measurement precision beyond today's capabilities. While quantum technologies are far from surpassing classical hardware today, the vision and potential impact has sparked a world-wide research effort, both theoretical and experimental, to develop a quantum computer. The most sophisticated current quantum technologies have control over small numbers of quantum bits and are limited by environmental decoherence processes. While progress in developing quantum hardware is ongoing, designing and demonstrating new algorithms and protocols for quantum information is a thriving research field. Photonics provides an ideal platform for small-scale proof-of-concept quantum experiments, which are the focus of this thesis. In the coming decades, we will see the realisation of quantum hardware capable of applications that outperform any classical computer. In this thesis, I present several protocols and algorithms for quantum information science and technology, which are implemented in quantum photonic experiments. The applications of these works include robust quantum tomography, quantum state relocation, quantum enhanced data recovery and probing fundamental causality in quantum mechanics. The works presented here are based on two photon experiments from a prototypical spontaneous parametric down-conversion source, which provides an excellent test-bed for quantum information experiments. Photons can be used to encode quantum information in a range of different degrees of freedom. This versatility, along with compatibility with existing technology gives photonics a great advantage in the development of quantum hardware.
This thesis investigates three distinct facets of the theory of quantum information. The first two, quantum state estimation and quantum process estimation, are closely related and deal with the question of how to estimate the classical parameters in a quantum mechanical model. The third attempts to bring quantum theory as close as possible to classical theory through the formalism of quasi-probability. \n \nBuilding a large scale quantum information processor is a significant challenge. First, we require an accurate characterization of the dynamics experienced by the device to allow for the application of error correcting codes and other tools for implementing useful quantum algorithms. The necessary scaling of computational resources needed to characterize a quantum system as a function of the number of subsystems is by now a well studied problem (the scaling is generally exponential). However, irrespective of the computational resources necessary to just write-down a classical description of a quantum state, we can ask about the experimental resources necessary to obtain data (measurement complexity) and the computational resources necessary to generate such a characterization (estimation complexity). These problems are studied here and approached from two directions. \n \nThe first problem we address is that of quantum state estimation. We apply high-level decision theoretic principles (applied in classical problems such as, for example, universal data compression) to the estimation of a qubit state. We prove that quantum states are more difficult to estimate than their classical counterparts by finding optimal estimation strategies. These strategies, requiring the solution to a difficult optimization problem, are difficult to implement in practise. Fortunately, we find estimation algorithms which come close to optimal but require far fewer resources to compute. Finally, we provide a classical analog of this quantum mechanical problem which reproduces, and gives intuitive explanations for, many of its features, such as why adaptive tomography can quadratically reduce its difficulty. \n \nThe second method for practical characterization of quantum devices takes is applied to the problem of quantum process estimation. This differs from the above analysis in two ways: (1) we apply strong restrictions on knowledge of various estimation and control parameters (the former making the problem easier, the latter making it harder); and (2) we consider the problem of designing future experiments based on the outcomes of past experiments. We show in test cases that adaptive protocols can exponentially outperform their off-line counterparts. Moreover, we adapt machine learning algorithms to the problem which bring these experimental design methodologies to realm of experimental feasibility. \n \nIn the final chapter we move away from estimation problems to show formally that a classical representation of quantum theory is not tenable. This intuitive conclusion is formally borne out through the connection to quasi-probability -- where it is equivalent to the necessity of negative probability in all such representations of quantum theory. In particular, we generalize previous no-go theorems to arbitrary classical representations of quantum systems of arbitrary dimension. We also discuss recent progress in the program to identify quantum resources for subtheories of quantum theory and operational restrictions motivated by quantum computation.
Entanglement is one of the most fascinating features of quantum theory, as it fundamentally distinguishes quantum systems from classical systems. It not only might play a role in natural processes, but provides an especially powerful resource for a plethora of quantum information protocols, including quantum state teleportation, superdense coding as well as quantum computation schemes. However, for larger systems involving more than two parties, it is a challenging task to verify and characterize entanglement. In this thesis, efficient means for detecting genuine multipartite entanglement in multiqubit quantum systems will be derived, demonstrated, and discussed. Beyond that, methods for quantum state and process tomography will be introduced, which allow to analyze and investigate prepared multipartite states or even the performance of whole setups. Some typical obstacles for reliable state tomography will be pointed out, together with new means to understand experimentally obtained data. Finally, the measurement problem, which describes the unavoidable backaction of a measurement process to the quantum state under investigation, will be illustrated. Together with the discussion of different methods of quantum measurements, the optimal measurement instruments for binary qubit measurements will be derived. These optimal measurement instruments allow to perform a quantum measurement, providing a tunable amount of information about the quantum state, while avoiding any unnecessary disturbance to the state. This set of optimal instruments will be compared to other measurement schemes, such as measurements based on the optimal quantum cloning protocol.
The current frontier of our understanding of the physical universe is dominated by quantum phenomena. Uncovering the prospects and limitations of acquiring and processing information using quantum effects is an outstanding challenge in physical science. This thesis presents an analysis of several new model systems and applications for quantum information processing and metrology.\n\nFirst, we analyze quantum optomechanical systems exhibiting quantum phenomena in both optical and mechanical degrees of freedom. We investigate the strength of non-classical correlations in a model system of two optical and one mechanical mode. We propose and analyze experimental protocols that exploit these correlations for quantum computation.\n\nWe then turn our attention to atom-cavity systems involving strong coupling of atoms with optical photons, and investigate the possibility of using them to store information robustly and as relay nodes. We present a scheme for a robust two-qubit quantum gate with inherent error-detection capabilities. We consider several remote entanglement protocols employing this robust gate, and we use these systems to study the performance of the gate in practical applications.\n\nFinally, we present a new protocol for running multiple, remote atomic clocks in quantum unison. We show that by creating a cascade of independent Greenberger-Horne-Zeilinger states distributed across the network, the scheme asymptotically reaches the Heisenberg limit, the fundamental limit of measurement accuracy. We propose an experimental realization of such a network consisting of neutral atom clocks, and analyze the practical performance of such a system.
Quantum clock synchronization (QCS) aims to establish a shared temporal reference between distant nodes by exploiting uniquely quantum phenomena such as entanglement, single-photon interference, and quantum correlations. In contrast to classical synchronization and time-transfer techniques, which are limited by signal propagation delays, atmospheric disturbances, and oscillator drift, QCS protocols offer the potential to surpass classical precision bounds and enhance resilience against adversarial manipulations. As precise and secure time synchronization underpins distributed quantum networks, navigation systems, and emerging quantum Internet infrastructures, understanding QCS principles, capabilities, and implementation challenges has become increasingly important. This survey provides a unified and critical overview of the rapidly growing QCS research landscape, highlighting fundamentals, protocol types, enabling resources, performance constraints, security considerations, and practical implementations of QCS. We first introduce the theoretical underpinnings of QCS, including entanglement-assisted time transfer, Hong-Ou-Mandel interference-based synchronization, and quantum slow-clock transport. We then categorize the main QCS protocols, ranging from ticking-qubit and entanglement-based schemes to time-of-arrival correlation methods, conveyor-belt synchronization, and quantum-enhanced two-way time transfer. This organization clarifies the relationships between protocol families and their achievable precision advantages over classical methods. Key quantum resources such as spontaneous parametric down-conversion-based entangled photon pairs, Greenberger-Horne-Zeilinger and W multipartite states, squeezed and frequency-entangled light, quantum frequency combs, and quantum memories are reviewed in the context of scalability and robustness.
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.