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:2412.07123

A Framework For Estimating Amplitudes of Quantum State With Single-Qubit Measurement

Nhat A. Nghiem

Published Dec 10, 2024• 0 citations
arXivHTMLPDF

Abstract

We propose and analyze a simple framework for estimating the amplitudes of a given $n$-qubit quantum state $\ketψ = \sum_{i=0}^{2^n-1} a_i \ket{i}$ in computational basis, utilizing a single-qubit measurement only. Previously, it was a common procedure that one could measure all qubits in order to collect measurement outcomes, from which one can estimate amplitudes of given quantum state. Here, we show that if restricting to single-qubit measurement, and one can perform measurement on arbitrary basis, then the measurement outcomes can be used to assist the finding of amplitudes in the usual computational, or Z basis. More concretely, such outcomes are capable of constructing a system of nonlinear algebraic equations, and by classically solving them, we obtain $\Tilde{a}_i$, which is the approximation to the corresponding amplitudes $a_i$, including both real and imaginary component. We then discuss our framework from a broader perspective. First, we show that estimating all (norms of) amplitudes to additive accuracy $δ$, i.e., $| |\Tilde{a}_i - |a_i| | \leq δ$ for all $i$, $\mathcal{O}(4^n/δ^4)$ single-qubit measurements is sufficient. Second, we show that to achieve total variation $\sum_{i=0}^{2^n-1} | |\Tilde{a}_i|^2 - |a_i|^2| \leq δ$, $\mathcal{O}(6^n/δ^4)$ a single bit measurement is required. Finally, in order to achieve an average $L_1$ norm error $ \sum_{i=0}^{2^n-1} | |\Tilde{a}_i| - |a_i| |/2^n \leq δ$, a single bit measurement $\mathcal{O}(2^n/ δ^4)$ is needed.

DOI
10.48550/arxiv.2412.07123

Related papers

Single-shot quantum neural networks with amplitude estimation

Jaemin Seo

Quantum neural networks (QNNs) suffer from a fundamental sampling bottleneck since quantum measurements are probabilistic, requiring many circuit executions to estimate outputs with sufficient accuracy. Conventional Monte-Carlo (MC) inference exhibits an $\mathcal{O}(1/\sqrt{N})$ sampling error, rendering QNN inference and training costly on near-term quantum hardware, especially where each shot requires expensive qubit generation. This work introduces a "single-shot" QNN framework by integrating quantum amplitude estimation (AE) into the readout stage. By embedding a trained QNN as a state-preparation oracle within AE, outputs are estimated through coherent interference rather than repeated sampling. We demonstrate that AE-based QNN inference achieves an $\mathcal{O}(1/N)$ error even with a single shot. We further analyze noise robustness and training feasibility, showing that AE can be a powerful primitive for overcoming the sampling overhead of QNNs. This highlights that when the model itself is quantum, quantum algorithms can enhance the computation efficiency.

quant-pharXiv:2604.19320•Apr 22, 2026•0 citations

High Precision Qubit-Efficient Variational Continuous Optimization via Amplitude Estimation

Parth Danve

Optimization of continuous-variable objectives on standard gate-based quantum computers via variational algorithms such as QAOA is typically approached by first discretizing each decision variable into a finite binary representation. This increases qubit requirements and restricts solution precision through fixed-resolution encodings. We propose a qubit-efficient variational framework for continuous optimization that instead encodes each decision variable into the squared amplitude or equivalently, the measurement probability of a single qubit state. This removes explicit discretization from the variable representation while remaining entirely within the standard qubit circuit model unlike methods like CV-QAOA employing qumode based hardware to achieve the same. To read out encoded variables, we propose using amplitude estimation rather than naive sampling or tomographic reconstruction, with the goal of improving precision scaling for continuous-value recovery. We outline how amplitude-estimation error propagates to decision-variable error and then to objective-value error under standard regularity assumptions, suggesting a distinct width-versus-precision tradeoff relative to discretized approaches. In particular, the framework replaces the logarithmic increase in qubits needed for finer binary precision with a constant cost of one qubit per decision variable, while shifting accuracy requirements into the estimation procedure. We position this approach relative to traditional discretized variational formulations, and argue that it provides a promising new direction for continuous optimization on standard qubit architectures.

quant-pharXiv:2606.08690•Jun 9, 2026•0 citations

Quantum Nonlinear Properties from a Single Measurement Setting

Zihao Li, Datong Chen, Dayue Qin +2 more

Nonlinear properties of quantum states are essential to quantum information and many-body physics, but assessing them experimentally is challenging, as it typically requires multi-copy operations or a large number of measurement settings. To address this challenge, we develop a universal framework, collision-based nonlinear estimation (CBNE), for efficiently measuring nonlinear quantities of a quantum state $ρ$, such as the higher-order expectation value ${\rm tr}(Oρ^t)$ for some observable $O$, using single-copy randomized measurements. Strikingly, our protocol requires only a single measurement setting, provided that the system dimension is sufficiently large or a few ancillary qubits are available; this contrasts with the conventional expectation that multiple measurement bases are necessary for nonlinear estimation. In addition, CBNE is observable-independent at the experimental stage, which enables simultaneous estimation of multiple nonlinear functions. It further extends to broader tasks, including the estimation of principal component properties and partial-transpose moments of quantum states. Our results provide a practical and scalable route for measuring nonlinear state properties on near-term quantum devices.

quant-pharXiv:2605.09958•May 12, 2026•0 citations

A shortcut to an optimal quantum linear system solver

Alexander M. Dalzell

Given a linear system of equations $A\boldsymbol{x}=\boldsymbol{b}$, quantum linear system solvers (QLSSs) approximately prepare a quantum state $|\boldsymbol{x}\rangle$ for which the amplitudes are proportional to the solution vector $\boldsymbol{x}$. Asymptotically optimal QLSSs have query complexity $O(κ\log(1/\varepsilon))$, where $κ$ is the condition number of $A$, and $\varepsilon$ is the approximation error. However, runtime guarantees for existing optimal and near-optimal QLSSs do not have favorable constant prefactors, in part because they rely on complex or difficult-to-analyze techniques like variable-time amplitude amplification and adiabatic path-following. Here, we give a conceptually simple QLSS that does not use these techniques. If the solution norm $\lVert\boldsymbol{x}\rVert$ is known exactly, our QLSS requires only a single application of kernel reflection (a straightforward extension of the eigenstate filtering (EF) technique of previous work) and the query complexity of the QLSS is $(1+O(\varepsilon))κ\ln(2\sqrt{2}/\varepsilon)$. If the norm is unknown, our method allows it to be estimated up to a constant factor using $O(\log\log(κ))$ applications of kernel projection (a direct generalization of EF) yielding a straightforward QLSS with near-optimal $O(κ\log\log(κ)\log\log\log(κ)+κ\log(1/\varepsilon))$ total complexity. Alternatively, by reintroducing a concept from the adiabatic path-following technique, we show that $O(κ)$ complexity can be achieved for norm estimation, yielding an optimal QLSS with $O(κ\log(1/\varepsilon))$ complexity while still avoiding the need to invoke the adiabatic theorem. Finally, we compute an explicit upper bound of $56κ+1.05κ\ln(1/\varepsilon)+o(κ)$ for the complexity of our optimal QLSS.

arXiv:2406.12086•Jun 17, 2024•1 citation

Component-wise Validation of Amplitude Encoding within Quantum Amplitude Estimation

Farhat M. A. Zargoun, Marwa B. Swidan

Quantum Amplitude Estimation (QAE) is a fundamental component of many quantum computing algorithms and applications. The practical implementation of QAE workflows on current Noisy Intermediate-Scale Quantum (NISQ) platforms requires accurate probability amplitude representation and reliable measurement recovery. Understanding the behavior of individual computational stages is therefore essential for improving the overall performance of practical quantum estimation procedures. This study presents a component-wise validation of the amplitude encoding process within a controlled quantum simulation environment. The experimental implementation was developed using the Qiskit framework, where classical probability values were encoded into single-qubit quantum states through parameterized rotation operations and subsequently recovered from measurement statistics. A systematic evaluation was performed across the probability interval from 0.1 to 0.9 using 8192 measurement shots for each experiment. The experimental results demonstrate that the recovered measurement probabilities closely match the corresponding target values throughout the investigated domain. Statistical evaluation produced a Mean Absolute Error (MAE) of 0.003521, a Mean Squared Error (MSE) of 1.67 × 10⁻⁵, and a Root Mean Squared Error (RMSE) of 0.004087, indicating high numerical consistency under ideal simulation conditions. The findings suggest that the amplitude encoding stage accurately represents classical probability values and provides a reliable baseline for studying more advanced quantum estimation workflows. The component-wise validation methodology adopted in this work offers a practical framework for investigating individual stages of quantum algorithms and supports future research on hybrid quantum-classical processing strategies for NISQ-era quantum computing.

AlQalam Journal of Medical and Applied Sciences•Jul 20, 2026•0 citations

Neural Network Learning of One-Bit Protocols for Qubit Measurement Simulation

Josep Escrig, Mani Zartab, Giulio Gasbarri +3 more

Communication complexity provides a natural framework for quantifying the classical resources required to reproduce quantum statistics. In the qubit prepare-and-measure scenario, two classical bits have been shown to be necessary and sufficient to simulate arbitrary qubit states and arbi- trary quantum measurements exactly. However, this result does not exclude the possibility that restricted families of measurements may admit accurate 1-bit classical approximations. We use a neural network procedure to demonstrate that a single bit can achieve high average accuracy for specific measurement families. A performance analysis of our neural network reveals that symmet- ric measurements with uniformly weighted elements, such as those forming regular polyhedra, are particularly amenable to this restricted communication. By analyzing the patterns learned by the neural network, we derive an analytical protocol that is extremely accurate for finite information- ally complete symmetric configurations and becomes exact in the limit of a continuous isotropic measurement.

quant-pharXiv:2607.23645•Jul 28, 2026•0 citations
We propose and analyze a simple framework for estimating the amplitudes of a given nnn-qubit quantum state ∣ψ⟩=∑i=02n−1ai∣i⟩\ketψ = \sum_{i=0}^{2^n-1} a_i \ket{i}∣ψ⟩=∑i=02n−1​ai​∣i⟩ in computational basis, utilizing a single-qubit measurement only. Previously, it was a common procedure that one could measure all qubits in order to collect measurement outcomes, from which one can estimate amplitudes of given quantum state. Here, we show that if restricting to single-qubit measurement, and one can perform measurement on arbitrary basis, then the measurement outcomes can be used to assist the finding of amplitudes in the usual computational, or Z basis. More concretely, such outcomes are capable of constructing a system of nonlinear algebraic equations, and by classically solving them, we obtain \Tildeai\Tilde{a}_i\Tildeai​, which is the approximation to the corresponding amplitudes aia_iai​, including both real and imaginary component. We then discuss our framework from a broader perspective. First, we show that estimating all (norms of) amplitudes to additive accuracy δδδ, i.e., ∣∣\Tildeai−∣ai∣∣≤δ| |\Tilde{a}_i - |a_i| | \leq δ∣∣\Tildeai​−∣ai​∣∣≤δ for all iii, O(4n/δ4)\mathcal{O}(4^n/δ^4)O(4n/δ4) single-qubit measurements is sufficient. Second, we show that to achieve total variation ∑i=02n−1∣∣\Tildeai∣2−∣ai∣2∣≤δ\sum_{i=0}^{2^n-1} | |\Tilde{a}_i|^2 - |a_i|^2| \leq δ∑i=02n−1​∣∣\Tildeai​∣2−∣ai​∣2∣≤δ, O(6n/δ4)\mathcal{O}(6^n/δ^4)O(6n/δ4) a single bit measurement is required. Finally, in order to achieve an average L1L_1L1​ norm error ∑i=02n−1∣∣\Tildeai∣−∣ai∣∣/2n≤δ \sum_{i=0}^{2^n-1} | |\Tilde{a}_i| - |a_i| |/2^n \leq δ∑i=02n−1​∣∣\Tildeai​∣−∣ai​∣∣/2n≤δ, a single bit measurement O(2n/δ4)\mathcal{O}(2^n/ δ^4)O(2n/δ4) is needed.
Quantum neural networks (QNNs) suffer from a fundamental sampling bottleneck since quantum measurements are probabilistic, requiring many circuit executions to estimate outputs with sufficient accuracy. Conventional Monte-Carlo (MC) inference exhibits an O(1/N)\mathcal{O}(1/\sqrt{N})O(1/N​) sampling error, rendering QNN inference and training costly on near-term quantum hardware, especially where each shot requires expensive qubit generation. This work introduces a "single-shot" QNN framework by integrating quantum amplitude estimation (AE) into the readout stage. By embedding a trained QNN as a state-preparation oracle within AE, outputs are estimated through coherent interference rather than repeated sampling. We demonstrate that AE-based QNN inference achieves an O(1/N)\mathcal{O}(1/N)O(1/N) error even with a single shot. We further analyze noise robustness and training feasibility, showing that AE can be a powerful primitive for overcoming the sampling overhead of QNNs. This highlights that when the model itself is quantum, quantum algorithms can enhance the computation efficiency.
Optimization of continuous-variable objectives on standard gate-based quantum computers via variational algorithms such as QAOA is typically approached by first discretizing each decision variable into a finite binary representation. This increases qubit requirements and restricts solution precision through fixed-resolution encodings. We propose a qubit-efficient variational framework for continuous optimization that instead encodes each decision variable into the squared amplitude or equivalently, the measurement probability of a single qubit state. This removes explicit discretization from the variable representation while remaining entirely within the standard qubit circuit model unlike methods like CV-QAOA employing qumode based hardware to achieve the same. To read out encoded variables, we propose using amplitude estimation rather than naive sampling or tomographic reconstruction, with the goal of improving precision scaling for continuous-value recovery. We outline how amplitude-estimation error propagates to decision-variable error and then to objective-value error under standard regularity assumptions, suggesting a distinct width-versus-precision tradeoff relative to discretized approaches. In particular, the framework replaces the logarithmic increase in qubits needed for finer binary precision with a constant cost of one qubit per decision variable, while shifting accuracy requirements into the estimation procedure. We position this approach relative to traditional discretized variational formulations, and argue that it provides a promising new direction for continuous optimization on standard qubit architectures.
Nonlinear properties of quantum states are essential to quantum information and many-body physics, but assessing them experimentally is challenging, as it typically requires multi-copy operations or a large number of measurement settings. To address this challenge, we develop a universal framework, collision-based nonlinear estimation (CBNE), for efficiently measuring nonlinear quantities of a quantum state ρρρ, such as the higher-order expectation value tr(Oρt){\rm tr}(Oρ^t)tr(Oρt) for some observable OOO, using single-copy randomized measurements. Strikingly, our protocol requires only a single measurement setting, provided that the system dimension is sufficiently large or a few ancillary qubits are available; this contrasts with the conventional expectation that multiple measurement bases are necessary for nonlinear estimation. In addition, CBNE is observable-independent at the experimental stage, which enables simultaneous estimation of multiple nonlinear functions. It further extends to broader tasks, including the estimation of principal component properties and partial-transpose moments of quantum states. Our results provide a practical and scalable route for measuring nonlinear state properties on near-term quantum devices.
Given a linear system of equations Ax=bA\boldsymbol{x}=\boldsymbol{b}Ax=b, quantum linear system solvers (QLSSs) approximately prepare a quantum state ∣x⟩|\boldsymbol{x}\rangle∣x⟩ for which the amplitudes are proportional to the solution vector x\boldsymbol{x}x. Asymptotically optimal QLSSs have query complexity O(κlog⁡(1/ε))O(κ\log(1/\varepsilon))O(κlog(1/ε)), where κκκ is the condition number of AAA, and ε\varepsilonε is the approximation error. However, runtime guarantees for existing optimal and near-optimal QLSSs do not have favorable constant prefactors, in part because they rely on complex or difficult-to-analyze techniques like variable-time amplitude amplification and adiabatic path-following. Here, we give a conceptually simple QLSS that does not use these techniques. If the solution norm ∥x∥\lVert\boldsymbol{x}\rVert∥x∥ is known exactly, our QLSS requires only a single application of kernel reflection (a straightforward extension of the eigenstate filtering (EF) technique of previous work) and the query complexity of the QLSS is (1+O(ε))κln⁡(22/ε)(1+O(\varepsilon))κ\ln(2\sqrt{2}/\varepsilon)(1+O(ε))κln(22​/ε). If the norm is unknown, our method allows it to be estimated up to a constant factor using O(log⁡log⁡(κ))O(\log\log(κ))O(loglog(κ)) applications of kernel projection (a direct generalization of EF) yielding a straightforward QLSS with near-optimal O(κlog⁡log⁡(κ)log⁡log⁡log⁡(κ)+κlog⁡(1/ε))O(κ\log\log(κ)\log\log\log(κ)+κ\log(1/\varepsilon))O(κloglog(κ)logloglog(κ)+κlog(1/ε)) total complexity. Alternatively, by reintroducing a concept from the adiabatic path-following technique, we show that O(κ)O(κ)O(κ) complexity can be achieved for norm estimation, yielding an optimal QLSS with O(κlog⁡(1/ε))O(κ\log(1/\varepsilon))O(κlog(1/ε)) complexity while still avoiding the need to invoke the adiabatic theorem. Finally, we compute an explicit upper bound of 56κ+1.05κln⁡(1/ε)+o(κ)56κ+1.05κ\ln(1/\varepsilon)+o(κ)56κ+1.05κln(1/ε)+o(κ) for the complexity of our optimal QLSS.
Quantum Amplitude Estimation (QAE) is a fundamental component of many quantum computing algorithms and applications. The practical implementation of QAE workflows on current Noisy Intermediate-Scale Quantum (NISQ) platforms requires accurate probability amplitude representation and reliable measurement recovery. Understanding the behavior of individual computational stages is therefore essential for improving the overall performance of practical quantum estimation procedures. This study presents a component-wise validation of the amplitude encoding process within a controlled quantum simulation environment. The experimental implementation was developed using the Qiskit framework, where classical probability values were encoded into single-qubit quantum states through parameterized rotation operations and subsequently recovered from measurement statistics. A systematic evaluation was performed across the probability interval from 0.1 to 0.9 using 8192 measurement shots for each experiment. The experimental results demonstrate that the recovered measurement probabilities closely match the corresponding target values throughout the investigated domain. Statistical evaluation produced a Mean Absolute Error (MAE) of 0.003521, a Mean Squared Error (MSE) of 1.67 × 10⁻⁵, and a Root Mean Squared Error (RMSE) of 0.004087, indicating high numerical consistency under ideal simulation conditions. The findings suggest that the amplitude encoding stage accurately represents classical probability values and provides a reliable baseline for studying more advanced quantum estimation workflows. The component-wise validation methodology adopted in this work offers a practical framework for investigating individual stages of quantum algorithms and supports future research on hybrid quantum-classical processing strategies for NISQ-era quantum computing.
Communication complexity provides a natural framework for quantifying the classical resources required to reproduce quantum statistics. In the qubit prepare-and-measure scenario, two classical bits have been shown to be necessary and sufficient to simulate arbitrary qubit states and arbi- trary quantum measurements exactly. However, this result does not exclude the possibility that restricted families of measurements may admit accurate 1-bit classical approximations. We use a neural network procedure to demonstrate that a single bit can achieve high average accuracy for specific measurement families. A performance analysis of our neural network reveals that symmet- ric measurements with uniformly weighted elements, such as those forming regular polyhedra, are particularly amenable to this restricted communication. By analyzing the patterns learned by the neural network, we derive an analytical protocol that is extremely accurate for finite information- ally complete symmetric configurations and becomes exact in the limit of a continuous isotropic measurement.