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

Classical-Input Simulation of Quantum Superchannels: From Linear to Quadratic Error with One More Outcome

Huayu Liu

Published Nov 9, 2026• 0 citations
Publisher

Abstract

One additional retained measurement outcome can change the optimal approximation order in classical-input simulation of a quantum superchannel. A classical-input realization first measures the external input and then applies a deterministic conditional process. The budget counts the complete retained label, including any shared random choice used at a later stage. We construct a fixed-dimensional family of state-input superchannels for which increasing the budget from four outcomes to five changes the optimal approximation error from linear to quadratic just above the exact realization threshold. The error is measured in the trace norm of the process Choi operator, and the optimization allows arbitrary measurement effects and deterministic conditional processes. The quadratic order is optimal over all finite measurements, and five is the smallest outcome budget that attains it. The same approximation orders hold in diamond distance for the associated joint-input channels. A correlated splitting of one effect cancels the linear defect with only a second-order change in the measurement obtained by merging the split outcomes. Throughout the family, the output channels share a four-outcome mother measurement and the process Choi operator is separable across the external-input cut. An independent theorem establishes local linear stability under stochastic postprocessing for rank-one target POVMs with distinct support rays, provided that the unknown POVM has no more outcomes than the target.

DOI
10.5281/zenodo.24068516

Related papers

Classical Simulation of Quantum Channel Families: Unbounded Cost Separation and Sharp Noise–Error Scaling

Huayu Liu

When the input measurement is fixed across a channel family, the simulation of binary output tests allows test-dependent responses, whereas preparing a quantum output requires one normalized state per recorded branch. We prove an unbounded separation between the optimized outcome costs of these tasks for families admitting a common mother measurement. The channel choices are specified by classical descriptions. For an explicit family of qubit channels, six outcomes suffice for all binary tests, whereas the exact channel cost is finite at every positive level of additional depolarizing noise and diverges as the noise vanishes. The family is the image of an explicit CPTP processor with a fixed finite-dimensional program and qubit input and output. For noise fraction λ and uniform output-channel diamond-norm error ε, the minimum common-measurement cost has the sharp order (λ + ε)^{−2/3} for 0 < λ + ε ≤ 1/2, both when channels are approximated independently and when the approximating family is generated by a single CPTP processor on the same spaces. The lower bound holds for arbitrary approximating channels subject only to the common-measurement budget. At each sufficiently small positive noise level, one finite common mother serves an entire full-dimensional process neighborhood of radius proportional to λ, throughout which the same cost law and six-outcome binary-test simulator persist.

•Nov 11, 2026•0 citations

Quantum Source Completions and Memory Environment Tradeoffs

Jeremy Rodgers

How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.

•Oct 28, 2026•0 citations

A General Theory of Comparison of Quantum Channels (and Beyond)

Anna Jenčová

We present a general theory of comparison of quantum channels, concerning with the question of simulability or approximate simulability of a given quantum channel by allowed transformations of another given channel. We introduce a modification of conditional min-entropies, with respect to the set F of allowed transformations, and show that under some conditions on F, these quantities characterize approximate simulability. If F is the set of free superchannels in a quantum resource theory of processes, the modified conditional min-entropies form a complete set of resource monotones. If the transformations in F consist of a preprocessing and a postprocessing of specified forms, approximate simulability is also characterized in terms of success probabilities in certain guessing games, where a preprocessing of a given form can be chosen and the measurements are restricted. These results are applied to several specific cases of simulability of quantum channels, including postprocessings, preprocessings and processing of bipartite channels by LOCC superchannels and by partial superchannels, as well as simulability of sets of quantum measurements. These questions are first studied in a general setting that is an extension of the framework of general probabilistic theories (GPT), suitable for dealing with channels. Here we prove a general theorem that shows that approximate simulability can be characterized by comparing outcome probabilities in certain tests. This result is inspired by the classical Le Cam randomization criterion for statistical experiments and contains its finite dimensional version as a special case.

arXiv:2002.04240•IEEE Transactions on Information Theory•Mar 31, 2021•11 citations

Minimum Quantum Storage from Incomplete Channel Observations

Jeremy Rodgers

How much quantum storage must a hidden implementation retain when experimental observations leave its structure undetermined? This paper establishes exact minimum quantum-storage requirements across all implementations compatible with specified channel observations. The resource is the worst-input expected logarithm of retained quantum dimension across one controlled temporal cut, with unlimited classical records available at no cost. For the channel dimension measure introduced by Cope and Uola, the paper proves their suggested minimax equality relating minimum storage to output Schmidt measure and extends it to every nonempty compact convex set of compatible channels. One common input enforces the resource minimum across all compatible implementations. A finite optimal implementation exists, although an optimal entangled probe need not. For qubit channels, four measured coefficients determine an exact, attained minimum without assuming channel covariance or unitality. An explicit five-Kraus construction attains 99/169, while a separate analytical certificate proves that every compatible implementation must use nontrivial quantum storage with at least that probability on the same specified input. A second exact formula uses only two Pauli-transfer coefficients and yields a minimum storage requirement of 0.58 when both coefficients are jointly constrained to the interval [0.79, 0.81]. The paper also presents semidefinite optimization over compatible experimental uncertainty regions. The results require calibrated quantum inputs and outputs, concealed preparation labels, and accounting for every quantum carrier across the storage cut. They constrain storage resources without reconstructing the hidden implementation or certifying environmental non-Markovianity. Motivated by Shadow Theory’s source/readout distinction, the proofs use standard quantum mechanics and quantum-information mathematics. Version 1.1 includes complete proofs, explicit attaining constructions, worked examples, and discussion of experimental assumptions and limitations. No experimental data are reported.

•Sep 6, 2026•0 citations

Optimal entanglement weights for heterodyne uncertainty with finite quantum memory

Zixuan He

A finite quantum memory is specified by more than its entanglement entropy. This paper determines how to shape its Schmidt weights and allocate optical photons to minimize the quantum conditional uncertainty of a prescribed heterodyne measurement. The resulting resource laws let researchers compare a uniformly weighted entangled source with a shaped source, and assess when sharing one memory across optical modes is more efficient than independently preparing mode–memory pairs. Complete preparation model and sharp leading resource law. Let \(V_{m,D}(E)\) be the minimum of \(H_\mu(Z|B)=h_\mu(Z)-\chi(Z:B)\) over all normal, possibly mixed optical–memory states with total mean photon number at most \(E\) and total accessible memory dimension at most \(D\). Here \(Z\) is the outcome of an \(m\)-mode heterodyne measurement, \(B\) is the retained quantum memory, \(\chi\) is Holevo information, and \(d\mu=\pi^{-m}d^{2m}z\). Accessible flags count toward the same memory budget. For every fixed \(m\) and every joint limit \(D,E\to\infty\), \[V_{m,D}(E)\sim\frac{\Lambda_m(E/T_D)}{T_D},\qquad T_D=(m!D)^{1/m}.\] The function \(\Lambda_m\) is an explicitly characterized constrained radial ground-state energy. Its Kummer and Bessel profiles give legal attaining preparations. The converse retains arbitrary coherent inputs and their photon tails, rather than optimizing only a diagonal ansatz. Why shaping changes the resource exponent. At the common photon ceiling \(E=T_D\), optimally shaped sources have uncertainty of order \(D^{-1/m}\), whereas final flat Schmidt spectra have optimal order \(D^{-1/(2m)}\), even after optimizing the occupied optical subspace. Flat weights create a sharp support boundary; tapering the weights replaces its boundary-layer cost by a smaller gradient cost. To reach a small target uncertainty \(\varepsilon\), this changes the leading memory requirement from \(2m\log_2(1/\varepsilon)\) to \(m\log_2(1/\varepsilon)\), and the attainable photon scaling from quadratic to linear in \(1/\varepsilon\). This improvement is compatible with nearly maximal entanglement entropy. For the explicit canonical saturated construction, \[S(\rho_{B,D})=\ln D-c_m+o(1),\qquad \|\rho_{B,D}-I_D/D\|_1\longrightarrow L_m>0.\] The full trace-norm limits are approximately \(L_1=0.8771\) and \(L_2=1.1170\); the half-trace-distance convention halves these numbers. Thus a vanishing relative entropy deficit does not make the optimized spectrum uniform. Collective preparation at fully counted resources. For two modes in the energy-sufficient asymptotic regime, sharing quantum memory reduces the leading conditional entropy by about \(10.24\%\) relative to the optimized independent mode–memory preparation class. That comparator includes local state optimization, integer memory and energy allocations, mixtures and charged accessible flags; it is not the class of all separable joint states. A separate finite construction uses seven coherent optical inputs, three retained qubits and \(0.21\) input photons. Under the specified loss, phase and stochastic memory-fault contract, its retained photon budget is at most \(0.200781\), and its conditional entropy is strictly lower than that of the same independent comparator by more than \(0.00547535\) nats. The integrated article gives the preparation circuit, one-sided numerical bounds and complete same-source error accounting. Interpretation. The objective uses quantum side information. A classical measurement of the memory generally has accessible information below \(\chi(Z:B)\), so the conditional-entropy advantages do not by themselves assert the same improvement in estimation precision or classical readout performance. The finite circuit is a rigorously specified source model, not a qualification of an implemented laboratory apparatus. The single PDF contains the article, five figures, full proofs and references.

•Oct 25, 2026•0 citations

Mitigating measurement errors in multiqubit experiments

Sergey B. Bravyi, Sarah Sheldon, Abhinav Kandala +2 more

Reducing measurement errors in multiqubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical postprocessing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error-mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parametrizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by applying the inverse noise matrix to a probability vector that represents the outcomes of a noisy measurement. The error-mitigation overhead, including the number of measurements and the cost of the classical postprocessing, is exponential in $\ensuremath{\epsilon}n$, where $\ensuremath{\epsilon}$ is the maximum error rate and $n$ is the number of qubits. We report experimental demonstration of our error-mitigation methods on IBM Quantum devices using stabilizer measurements for graph states with $n\ensuremath{\le}12$ qubits and entangled 20-qubit states generated by low-depth random Clifford circuits.

arXiv:2006.14044•Physical Review A•Apr 9, 2021•402 citations
One additional retained measurement outcome can change the optimal approximation order in classical-input simulation of a quantum superchannel. A classical-input realization first measures the external input and then applies a deterministic conditional process. The budget counts the complete retained label, including any shared random choice used at a later stage. We construct a fixed-dimensional family of state-input superchannels for which increasing the budget from four outcomes to five changes the optimal approximation error from linear to quadratic just above the exact realization threshold. The error is measured in the trace norm of the process Choi operator, and the optimization allows arbitrary measurement effects and deterministic conditional processes. The quadratic order is optimal over all finite measurements, and five is the smallest outcome budget that attains it. The same approximation orders hold in diamond distance for the associated joint-input channels. A correlated splitting of one effect cancels the linear defect with only a second-order change in the measurement obtained by merging the split outcomes. Throughout the family, the output channels share a four-outcome mother measurement and the process Choi operator is separable across the external-input cut. An independent theorem establishes local linear stability under stochastic postprocessing for rank-one target POVMs with distinct support rays, provided that the unknown POVM has no more outcomes than the target.
When the input measurement is fixed across a channel family, the simulation of binary output tests allows test-dependent responses, whereas preparing a quantum output requires one normalized state per recorded branch. We prove an unbounded separation between the optimized outcome costs of these tasks for families admitting a common mother measurement. The channel choices are specified by classical descriptions. For an explicit family of qubit channels, six outcomes suffice for all binary tests, whereas the exact channel cost is finite at every positive level of additional depolarizing noise and diverges as the noise vanishes. The family is the image of an explicit CPTP processor with a fixed finite-dimensional program and qubit input and output. For noise fraction λ and uniform output-channel diamond-norm error ε, the minimum common-measurement cost has the sharp order (λ + ε)^{−2/3} for 0 < λ + ε ≤ 1/2, both when channels are approximated independently and when the approximating family is generated by a single CPTP processor on the same spaces. The lower bound holds for arbitrary approximating channels subject only to the common-measurement budget. At each sufficiently small positive noise level, one finite common mother serves an entire full-dimensional process neighborhood of radius proportional to λ, throughout which the same cost law and six-outcome binary-test simulator persist.
How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.
We present a general theory of comparison of quantum channels, concerning with the question of simulability or approximate simulability of a given quantum channel by allowed transformations of another given channel. We introduce a modification of conditional min-entropies, with respect to the set F of allowed transformations, and show that under some conditions on F, these quantities characterize approximate simulability. If F is the set of free superchannels in a quantum resource theory of processes, the modified conditional min-entropies form a complete set of resource monotones. If the transformations in F consist of a preprocessing and a postprocessing of specified forms, approximate simulability is also characterized in terms of success probabilities in certain guessing games, where a preprocessing of a given form can be chosen and the measurements are restricted. These results are applied to several specific cases of simulability of quantum channels, including postprocessings, preprocessings and processing of bipartite channels by LOCC superchannels and by partial superchannels, as well as simulability of sets of quantum measurements. These questions are first studied in a general setting that is an extension of the framework of general probabilistic theories (GPT), suitable for dealing with channels. Here we prove a general theorem that shows that approximate simulability can be characterized by comparing outcome probabilities in certain tests. This result is inspired by the classical Le Cam randomization criterion for statistical experiments and contains its finite dimensional version as a special case.
How much quantum storage must a hidden implementation retain when experimental observations leave its structure undetermined? This paper establishes exact minimum quantum-storage requirements across all implementations compatible with specified channel observations. The resource is the worst-input expected logarithm of retained quantum dimension across one controlled temporal cut, with unlimited classical records available at no cost. For the channel dimension measure introduced by Cope and Uola, the paper proves their suggested minimax equality relating minimum storage to output Schmidt measure and extends it to every nonempty compact convex set of compatible channels. One common input enforces the resource minimum across all compatible implementations. A finite optimal implementation exists, although an optimal entangled probe need not. For qubit channels, four measured coefficients determine an exact, attained minimum without assuming channel covariance or unitality. An explicit five-Kraus construction attains 99/169, while a separate analytical certificate proves that every compatible implementation must use nontrivial quantum storage with at least that probability on the same specified input. A second exact formula uses only two Pauli-transfer coefficients and yields a minimum storage requirement of 0.58 when both coefficients are jointly constrained to the interval [0.79, 0.81]. The paper also presents semidefinite optimization over compatible experimental uncertainty regions. The results require calibrated quantum inputs and outputs, concealed preparation labels, and accounting for every quantum carrier across the storage cut. They constrain storage resources without reconstructing the hidden implementation or certifying environmental non-Markovianity. Motivated by Shadow Theory’s source/readout distinction, the proofs use standard quantum mechanics and quantum-information mathematics. Version 1.1 includes complete proofs, explicit attaining constructions, worked examples, and discussion of experimental assumptions and limitations. No experimental data are reported.
A finite quantum memory is specified by more than its entanglement entropy. This paper determines how to shape its Schmidt weights and allocate optical photons to minimize the quantum conditional uncertainty of a prescribed heterodyne measurement. The resulting resource laws let researchers compare a uniformly weighted entangled source with a shaped source, and assess when sharing one memory across optical modes is more efficient than independently preparing mode–memory pairs. Complete preparation model and sharp leading resource law. Let Vm,D(E)V_{m,D}(E)Vm,D​(E) be the minimum of Hμ(Z∣B)=hμ(Z)−χ(Z:B)H_\mu(Z|B)=h_\mu(Z)-\chi(Z:B)Hμ​(Z∣B)=hμ​(Z)−χ(Z:B) over all normal, possibly mixed optical–memory states with total mean photon number at most EEE and total accessible memory dimension at most DDD. Here ZZZ is the outcome of an mmm-mode heterodyne measurement, BBB is the retained quantum memory, χ\chiχ is Holevo information, and dμ=π−md2mzd\mu=\pi^{-m}d^{2m}zdμ=π−md2mz. Accessible flags count toward the same memory budget. For every fixed mmm and every joint limit D,E→∞D,E\to\inftyD,E→∞, Vm,D(E)∼Λm(E/TD)TD,TD=(m!D)1/m.V_{m,D}(E)\sim\frac{\Lambda_m(E/T_D)}{T_D},\qquad T_D=(m!D)^{1/m}.Vm,D​(E)∼TD​Λm​(E/TD​)​,TD​=(m!D)1/m. The function Λm\Lambda_mΛm​ is an explicitly characterized constrained radial ground-state energy. Its Kummer and Bessel profiles give legal attaining preparations. The converse retains arbitrary coherent inputs and their photon tails, rather than optimizing only a diagonal ansatz. Why shaping changes the resource exponent. At the common photon ceiling E=TDE=T_DE=TD​, optimally shaped sources have uncertainty of order D−1/mD^{-1/m}D−1/m, whereas final flat Schmidt spectra have optimal order D−1/(2m)D^{-1/(2m)}D−1/(2m), even after optimizing the occupied optical subspace. Flat weights create a sharp support boundary; tapering the weights replaces its boundary-layer cost by a smaller gradient cost. To reach a small target uncertainty ε\varepsilonε, this changes the leading memory requirement from 2mlog⁡2(1/ε)2m\log_2(1/\varepsilon)2mlog2​(1/ε) to mlog⁡2(1/ε)m\log_2(1/\varepsilon)mlog2​(1/ε), and the attainable photon scaling from quadratic to linear in 1/ε1/\varepsilon1/ε. This improvement is compatible with nearly maximal entanglement entropy. For the explicit canonical saturated construction, S(ρB,D)=ln⁡D−cm+o(1),∥ρB,D−ID/D∥1⟶Lm>0.S(\rho_{B,D})=\ln D-c_m+o(1),\qquad \|\rho_{B,D}-I_D/D\|_1\longrightarrow L_m>0.S(ρB,D​)=lnD−cm​+o(1),∥ρB,D​−ID​/D∥1​⟶Lm​>0. The full trace-norm limits are approximately L1=0.8771L_1=0.8771L1​=0.8771 and L2=1.1170L_2=1.1170L2​=1.1170; the half-trace-distance convention halves these numbers. Thus a vanishing relative entropy deficit does not make the optimized spectrum uniform. Collective preparation at fully counted resources. For two modes in the energy-sufficient asymptotic regime, sharing quantum memory reduces the leading conditional entropy by about 10.24%10.24\%10.24% relative to the optimized independent mode–memory preparation class. That comparator includes local state optimization, integer memory and energy allocations, mixtures and charged accessible flags; it is not the class of all separable joint states. A separate finite construction uses seven coherent optical inputs, three retained qubits and 0.210.210.21 input photons. Under the specified loss, phase and stochastic memory-fault contract, its retained photon budget is at most 0.2007810.2007810.200781, and its conditional entropy is strictly lower than that of the same independent comparator by more than 0.005475350.005475350.00547535 nats. The integrated article gives the preparation circuit, one-sided numerical bounds and complete same-source error accounting. Interpretation. The objective uses quantum side information. A classical measurement of the memory generally has accessible information below χ(Z:B)\chi(Z:B)χ(Z:B), so the conditional-entropy advantages do not by themselves assert the same improvement in estimation precision or classical readout performance. The finite circuit is a rigorously specified source model, not a qualification of an implemented laboratory apparatus. The single PDF contains the article, five figures, full proofs and references.
Reducing measurement errors in multiqubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical postprocessing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error-mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parametrizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by applying the inverse noise matrix to a probability vector that represents the outcomes of a noisy measurement. The error-mitigation overhead, including the number of measurements and the cost of the classical postprocessing, is exponential in $\ensuremath{\epsilon}n$, where $\ensuremath{\epsilon}$ is the maximum error rate and nnn is the number of qubits. We report experimental demonstration of our error-mitigation methods on IBM Quantum devices using stabilizer measurements for graph states with $n\ensuremath{\le}12$ qubits and entangled 20-qubit states generated by low-depth random Clifford circuits.