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

Foundations of Physics

Quantum measurements, sequential and latent

Robert Henry Dicke

Published Apr 1, 1989• 13 citations
Publisher
DOI
10.1007/bf00731832

Related papers

Entropic Efficiency of Bayesian Inference Protocols

Nathan Shettell, Alexia Auffèves

Inference is a versatile tool that underlies scientific discovery, machine learning, and everyday decision-making: it describes how an agent updates a probability distribution as partial information is acquired from multiple measurements, reducing ignorance about a system's latent state. We define an inferential efficiency as the ratio of information gain to cumulative memory erasure cost, with inefficiency arising from unexploited correlations between the measured system and memories, and/or between memories and environment (noise). Using this efficiency, we benchmark two limiting measurement paradigms: sequential, in which the same memory is exploited iteratively, and parallel, in which many memories are exploited simultaneously. In both cases, the minimal erasure cost reflects correlations across memories: temporal in sequential, spatial in parallel. Remarkably, when all system-memory correlations are exploited for inference, both paradigms attain the same minimal erasure cost, even in the presence of noise. Conversely, the parallel paradigm performs better in the presence of unexploited correlations, stemming from hidden memories' degrees of freedom. This approach provides a quantitative, physically grounded criterion to compare inference strategies, determine their efficiency, and link target information gains to their minimal entropic cost.

cond-mat.stat-mechCross-listedarXiv:2601.17282•Jan 27, 2026•3 citations

Sequential products of quantum measurements

Stanley Gudder

Reports on Mathematical Physics•Oct 1, 2007•13 citations

Tensor Ring Decomposition

Qibin Zhao, Guoxu Zhou, Shengli Xie +2 more

Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the complicated tensor networks. However, the TT decomposition highly depends on permutations of tensor dimensions, due to its strictly sequential multilinear products over latent cores, which leads to difficulties in finding the optimal TT representation. In this paper, we introduce a fundamental tensor decomposition model to represent a large dimensional tensor by a circular multilinear products over a sequence of low dimensional cores, which can be graphically interpreted as a cyclic interconnection of 3rd-order tensors, and thus termed as tensor ring (TR) decomposition. The key advantage of TR model is the circular dimensional permutation invariance which is gained by employing the trace operation and treating the latent cores equivalently. TR model can be viewed as a linear combination of TT decompositions, thus obtaining the powerful and generalized representation abilities. For optimization of latent cores, we present four different algorithms based on the sequential SVDs, ALS scheme, and block-wise ALS techniques. Furthermore, the mathematical properties of TR model are investigated, which shows that the basic multilinear algebra can be performed efficiently by using TR representaions and the classical tensor decompositions can be conveniently transformed into the TR representation. Finally, the experiments on both synthetic signals and real-world datasets were conducted to evaluate the performance of different algorithms.

arXiv:1606.05535•Jun 17, 2016•575 citations

Sequential Measurements in Quantum Mechanics

Willis E. Lamb

NATO ASI series. Series B : Physics•Jan 1, 1987•5 citations

Uncertainty-Aware Quantum State Tomography via Latent Posterior Factors: A Multi-Evidence Aggregation Approach

Aliyu Agboola Alege

Quantum state tomography is fundamental to quantum computing verification and quantum cryptography validation, yet existing methods provide point estimates without quantifying when additional measurements are needed. We introduce Latent Posterior Factors (LPF) \citep{aliyu2026lpf,aliyu2026theory}, the first multi-evidence aggregation system with exact uncertainty decomposition for quantum measurements. LPF achieves 99.8% classification accuracy and 0.979 ± 0.051 fidelity on single-qubit tomography, with 50% fewer errors than maximum likelihood estimation (MLE) (0.21% vs. 0.43% error rate) despite MLE's asymptotic optimality. Critically, LPF provides perfectly calibrated uncertainties (Expected Calibration Error 0.17%) and exact epistemic-aleatoric decomposition: 46% of uncertainty is reducible through additional measurements, while 54% represents irreducible quantum randomness. When LPF reports 95% confidence, it is correct 95.1% of the time—enabling experimentalists to make trustworthy decisions about measurement sufficiency. The framework's learned aggregation captures Pauli measurement correlations that violate MLE's independence assumptions, explaining LPF's superior error rate despite lower continuous fidelity metrics. Cross-seed analysis across 11 random initializations demonstrates exceptional robustness (fidelity σ = 0.0003), validating theoretical soundness. Epistemic uncertainty reliably indicates measurement insufficiency, enabling adaptive protocols that achieve 10% measurement reduction in controlled experiments while maintaining accuracy—with production deployments estimated to realize greater savings when accounting for inter-measurement overhead. Keywords:Quantum state tomography, quantum computing verification, uncertainty quantification, epistemic uncertainty, aleatoric uncertainty, uncertainty decomposition, probabilistic inference, multi-evidence aggregation, Latent Posterior Factors (LPF), measurement optimization, maximum likelihood estimation (MLE), calibration (ECE), quantum measurement, adaptive protocols, interpretable uncertainty, quantum information processing, experimental physics AI

•Mar 18, 2026•0 citations

Quantum Measurement

Daniel F. Walls, Gerard J Milburn

Graduate texts in physics•Jan 1, 2025•0 citations
Inference is a versatile tool that underlies scientific discovery, machine learning, and everyday decision-making: it describes how an agent updates a probability distribution as partial information is acquired from multiple measurements, reducing ignorance about a system's latent state. We define an inferential efficiency as the ratio of information gain to cumulative memory erasure cost, with inefficiency arising from unexploited correlations between the measured system and memories, and/or between memories and environment (noise). Using this efficiency, we benchmark two limiting measurement paradigms: sequential, in which the same memory is exploited iteratively, and parallel, in which many memories are exploited simultaneously. In both cases, the minimal erasure cost reflects correlations across memories: temporal in sequential, spatial in parallel. Remarkably, when all system-memory correlations are exploited for inference, both paradigms attain the same minimal erasure cost, even in the presence of noise. Conversely, the parallel paradigm performs better in the presence of unexploited correlations, stemming from hidden memories' degrees of freedom. This approach provides a quantitative, physically grounded criterion to compare inference strategies, determine their efficiency, and link target information gains to their minimal entropic cost.
Tensor networks have in recent years emerged as the powerful tools for solving the large-scale optimization problems. One of the most popular tensor network is tensor train (TT) decomposition that acts as the building blocks for the complicated tensor networks. However, the TT decomposition highly depends on permutations of tensor dimensions, due to its strictly sequential multilinear products over latent cores, which leads to difficulties in finding the optimal TT representation. In this paper, we introduce a fundamental tensor decomposition model to represent a large dimensional tensor by a circular multilinear products over a sequence of low dimensional cores, which can be graphically interpreted as a cyclic interconnection of 3rd-order tensors, and thus termed as tensor ring (TR) decomposition. The key advantage of TR model is the circular dimensional permutation invariance which is gained by employing the trace operation and treating the latent cores equivalently. TR model can be viewed as a linear combination of TT decompositions, thus obtaining the powerful and generalized representation abilities. For optimization of latent cores, we present four different algorithms based on the sequential SVDs, ALS scheme, and block-wise ALS techniques. Furthermore, the mathematical properties of TR model are investigated, which shows that the basic multilinear algebra can be performed efficiently by using TR representaions and the classical tensor decompositions can be conveniently transformed into the TR representation. Finally, the experiments on both synthetic signals and real-world datasets were conducted to evaluate the performance of different algorithms.
Quantum state tomography is fundamental to quantum computing verification and quantum cryptography validation, yet existing methods provide point estimates without quantifying when additional measurements are needed. We introduce Latent Posterior Factors (LPF) \citep{aliyu2026lpf,aliyu2026theory}, the first multi-evidence aggregation system with exact uncertainty decomposition for quantum measurements. LPF achieves 99.8% classification accuracy and 0.979 ± 0.051 fidelity on single-qubit tomography, with 50% fewer errors than maximum likelihood estimation (MLE) (0.21% vs. 0.43% error rate) despite MLE's asymptotic optimality. Critically, LPF provides perfectly calibrated uncertainties (Expected Calibration Error 0.17%) and exact epistemic-aleatoric decomposition: 46% of uncertainty is reducible through additional measurements, while 54% represents irreducible quantum randomness. When LPF reports 95% confidence, it is correct 95.1% of the time—enabling experimentalists to make trustworthy decisions about measurement sufficiency. The framework's learned aggregation captures Pauli measurement correlations that violate MLE's independence assumptions, explaining LPF's superior error rate despite lower continuous fidelity metrics. Cross-seed analysis across 11 random initializations demonstrates exceptional robustness (fidelity σ = 0.0003), validating theoretical soundness. Epistemic uncertainty reliably indicates measurement insufficiency, enabling adaptive protocols that achieve 10% measurement reduction in controlled experiments while maintaining accuracy—with production deployments estimated to realize greater savings when accounting for inter-measurement overhead. Keywords:Quantum state tomography, quantum computing verification, uncertainty quantification, epistemic uncertainty, aleatoric uncertainty, uncertainty decomposition, probabilistic inference, multi-evidence aggregation, Latent Posterior Factors (LPF), measurement optimization, maximum likelihood estimation (MLE), calibration (ECE), quantum measurement, adaptive protocols, interpretable uncertainty, quantum information processing, experimental physics AI