Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization SU(2) rotation channel
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: We're looking at the paper: "Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization SU(2) rotation channel".
Mira: Here's the gist of the paper. The Bayesian Nagaoka–Hayashi (NH) bound is a semidefinite lower bound on the Bayes risk of multiparameter estimation, tighter than the Bayesian symmertic logarithmic derivative (SLD) Cram´er–Rao bounds, and whether it can be attained is an open problem.
Kai: This study investigates the single-shot estimation of a qubit rotation with all three parameters under depolarizing noise and a uniform prior using k parallel uses of the channel.
Mira: The optimized strategy reaches the NH bound within numerical precision, providing evidence that this bound is attained for this channel family, while the SLD bound lies strictly below it.
Kai: Bayesian Estimation Framework The estimation problem involves estimating a set of unknown parameters θ = (θ1,..., θd) that label a family of completely positive and trace-preserving channels Λθ.
Title and authors: Mira: So we're looking at this paper, "Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization SU(two) rotation channel," and it really zeroes in on a specific problem: estimating a qubit rotation with all three parameters simultaneously under depolarizing noise using k parallel uses of the channel <ref:2607.15398#pg1,Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization>.
Kai: Yeah, that sounds like something we've been thinking about because those multiparameter estimation problems get messy fast when you add noise. This paper is showing how to use this Bayesian Nagaoka-Hayashi bound to get a lower limit on the risk, and it claims they can actually hit that limit numerically for every number of uses and noise strength they test.
Lev: Hitting the bound numerically is one thing, but what does that mean for us when we're talking about actual hardware? We know this kind of problem scales up quickly if you try to solve it with a fixed probe state, so I'm interested in how their optimization handles the complexity of the measurement and the estimator together.
Mira: Exactly, they are using rotational covariance to reduce that whole problem down to small semidefinite programs that they can solve using k equals four parallel uses of the channel. They found that this approach allows them to find a strategy—the optimal probe, measurement, and estimator—that actually reaches the Nagaoka-Hayashi bound within numerical precision.
Kai: So, if I understand right, it's not just that they found a lower limit; they found a way to construct an actual estimation strategy that gets arbitrarily close to that theoretical limit for this specific channel family. That’s a strong piece of evidence.
Lev: It's solid evidence for the model, but we have to remember what the paper notes about these kinds of bounds generally. They clearly state that whether this bound can actually be attained is an open problem in general, even if they show it happens here.
Mira: Right, and that’s where the comparison with other bounds becomes important. They point out that the Bayesian Nagaoka-Hayashi bound is tighter than the Bayesian symmetric logarithmic derivative Cramér–Rao bounds, which is a significant improvement over what we usually have for this type of estimation.
Kai: It seems like they're really stressing how much better this NH bound is compared to the SLD bounds that Personick and Rubio and Dunningham established for multiparameter cases where the measurement operators don't commute.
Lev: And the paper shows how their optimization method, using those small semidefinite programs reduced by rotational covariance, finds a strategy that performs better than what you'd get from just looking at individual parameter estimates. That means we need to look at how these covariant methods translate to real experimental setups.
Title and authors: Mira: They also mention something interesting about the physical state of the probe as noise increases; they observe that when depolarization grows, the optimal probe collapses to the tensored Bell state, which gives us a clue about where we should allocate our resources in noisy environments.
Kai: That collapse to the tensored Bell state is actually quite tangible for hardware designers. It tells us that under increasing noise, if we want to maintain precision with this method, our physical probe needs to look like that specific entangled state.
Lev: If we were building this on a real superconducting platform, knowing the optimal probe shape as a function of noise is essential for designing the actual quantum hardware and the readout sequence. That’s where the engineering reality comes in.
Mira: So, to summarize what they achieved here with "Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization SU(two) rotation channel," they showed that by using rotational covariance to turn it into solvable semidefinite programs, they can construct a strategy that numerically hits the NH bound even when noise is high <ref:2607.15398#pg1,Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization>.
Kai: And they also pointed out a key improvement: this method lets you optimize the probe, measurement, and estimator all at once under k parallel uses of the channel, which is much more comprehensive than just optimizing one part separately.
Lev: I'd add that while they say it hits the bound numerically, we still have that open question about whether it can be attained exactly in practice when you move out of this toy SU(two) rotation case and into more complex scenarios <ref:2607.15398#pg1,whether it can be attained>.
Mira: Exactly, and looking at what they do for the depolarization channel, it sets a benchmark. It tells us that for this specific family of channels, the NH bound isn't just a theoretical wall; it’s something achievable if you can solve the underlying optimization problem correctly.
Kai: So, as we wrap up this part, they are giving us concrete numerical evidence that the NH bound holds for this channel family across all tested uses and noise levels. It moves the discussion from "this is possible" to "this is numerically demonstrated."
Lev: For me, what this paper implies is that our current theoretical tools for finding optimal estimation strategies need to be more robust when dealing with the interplay between the probe choice, the measurement setup, and how many times we can run it.
Title and authors: Mira: And I think what they show us is how using symmetry reduction techniques helps bridge that gap, turning an intractable problem into something solvable via k equals four semidefinite programs.
Kai: So, for our listeners who are driving or cooking—if you're thinking about quantum sensing in noisy environments, this paper gives you a concrete way to see how the theoretical limits translate into what an actual estimation strategy looks like on the ground.
Lev: And remember, even with numerical proof of hitting that bound here for the SU(two) rotation channel, we still have to worry about whether it holds up when we introduce more complex noise models or more parameters than just three <ref:2607.15398#pg1>.
Mira: We'll keep an eye on this work as it relates to how these covariant methods apply to other non-commuting observables and how they handle those larger parameter sets.
Kai: It's a good reminder that the path to actual quantum advantage often involves finding these clever ways to simplify the optimization landscape, even if we still have some open questions about the final attainment proof.
Lev: Yeah, so for now, this paper gives us a very solid numerical benchmark for how tight those limits are in this specific context before we try to apply it elsewhere.
Mira: That's the core idea—using the Bayesian Nagaoka-Hayashi bound as a tighter benchmark than the symmetric logarithmic derivative when we have multiple parameters and noise.
Kai: We’ve talked about hitting that bound numerically, how they use rotational covariance to simplify the math, and what that means for probe design under increasing noise.
Lev: And we've touched on the caveat—that it's a numerical demonstration for this specific case, not a general proof of attainment.
Mira: So, we’re leaving this paper with the idea that symmetry reduction is a powerful tool for tackling multiparameter estimation problems by transforming them into manageable semidefinite programs.
Kai: And that the optimal probe state itself has a physical structure—collapsing to the tensored Bell state—which is directly related to how much noise you're dealing with.
Lev: Exactly, so if you are building something, knowing that optimal probe structure as noise changes is crucial for making real hardware decisions.
Mira: It’s a good example of how theory and experiment meet here; the math gives us the limit, and the optimization tells us how to get there in practice.
Kai: So that's our rundown on "Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization SU(two) rotation channel <ref:2607.15398#pg1,Saturating the Bayesian Nagaoka-Hayashi bound within numerical precision for the depolarization>." We’ll be looking at other papers next week.
The paper's summary: Kai: So, to recap, this paper shows that for estimating a qubit rotation with three parameters under depolarizing noise using k parallel uses of the channel, they found a numerical strategy that actually hits the Bayesian Nagaoka-Hayashi bound.
Mira: That’s right. It's not just some theoretical limit anymore; they found a specific way to build an actual estimation plan that gets arbitrarily close to that bound for every number of uses and every level of noise they tested in this SU(two) rotation case.
Lev: From my side, hitting the bound numerically is one thing, but it tells us how the overhead lands on real hardware. If we try to implement this strategy on a superconducting chip, we need to see if that "optimal probe" state they found actually collapses into something physically realizable when the noise gets higher.
Kai: That’s exactly what I want to hear. The paper says that as the noise grows, the optimal probe state collapses towards a tensored Bell state. So it gives us a very clear hint about what kind of entangled resource we need to prepare if we want to use this method effectively under more demanding conditions.
Mira: And looking at the assumptions, they are working with a depolarizing channel and a uniform prior, which is pretty simple for this specific problem, but the result needs that assumption to hold true for the general case of multiparameter estimation.
Lev: Right. The paper says it’s an open question whether this bound can be attained exactly in practice when you move away from this simple SU(two) rotation and introduce more complex noise models or more parameters than just three.
Kai: So, the real value here is the methodology they used—taking that big estimation problem and reducing it down to these small semidefinite programs using rotational covariance, which lets them actually solve it with a small number of parallel uses, k equals four.
Mira: That reduction technique is pretty clever because it lets you handle the complexity without getting immediately lost in an infinite-dimensional mess of possibilities. It shows that symmetry reduction can make these tough problems tractable for estimation strategies.
Lev: For me, it means if we want to push this into a real quantum error-correction framework, we need to be very careful how we translate those constraints from the abstract SDPs back into physical operations on the actual qubits.
Kai: So, looking at the bigger picture, what this really shows is that for estimation problems with multiple parameters, there are specific mathematical structures—like rotational covariance—that let us find strategies better than what we'd get from just looking at each parameter separately.
Mira: It confirms that the Bayesian Nagaoka-Hayashi bound is a much tighter lower limit than the symmetric logarithmic derivative bounds they mentioned earlier, and it’s worth focusing on those kinds of bounds when you have multiple parameters to estimate.
Lev: And remember, while they proved it for this channel family, we still have to figure out if that attainment holds up when we try to apply this whole framework to different types of noise or more complicated quantum operations.
Kai: So the practical implication is that if you are designing a quantum sensor where you need high precision across multiple settings, knowing how your optimal probe state changes with noise, and having a method that can find the best measurement setup using these SDPs, gives you a much clearer path forward.
The paper's improvements: Tom: So, to recap, this paper shows that for estimating a qubit rotation with three parameters under depolarizing noise using k parallel uses of the channel, they found a numerical strategy that actually hits the Bayesian Nagaoka-Hayashi bound.
Kai: That’s right. It's not just some theoretical limit anymore; they found a specific way to build an actual estimation plan that gets arbitrarily close to that bound for every number of uses and every level of noise they tested in this SU(two) rotation case.
Mira: From my side, hitting the bound numerically is one thing, but it tells us how the overhead lands on real hardware. If we try to implement this strategy on a superconducting chip, we need to see if that "optimal probe" state they found actually collapses into something physically realizable when the noise gets higher.
Lev: That’s exactly what I want to hear. The paper says that as the noise grows, the optimal probe state collapses towards a tensored Bell state. So it gives us a very clear hint about what kind of entangled resource we need to prepare if we want to use this method effectively under more demanding conditions.
Kai: And looking at the assumptions, they are working with a depolarizing channel and a uniform prior, which is pretty simple for this specific problem, but the result needs that assumption to hold true for the general case of multiparameter estimation.
Mira: Right. The paper says it’s an open question whether this bound can be attained exactly in practice when you move away from this simple SU(two) rotation and introduce more complex noise models or more parameters than just three.
Lev: So, the real value here is the methodology they used—taking that big estimation problem and reducing it down to these small semidefinite programs using rotational covariance, which lets them actually solve it with a small number of parallel uses, k equals four.
Kai: That reduction technique is pretty clever because it lets you handle the complexity without getting immediately lost in an infinite-dimensional mess of possibilities. It shows that symmetry reduction can make these tough problems tractable for estimation strategies.
Mira: And they also found a way to optimize the measurement and estimator together, not just one part at a time, which is pretty important when you're dealing with correlated noise and multiple parameters.
Lev: For me, it means if we want to push this into a real quantum error-correction framework, we need to be very careful how we translate those constraints from the abstract semidefinite programs back into physical operations on the actual qubits.
Kai: So, looking at the bigger picture, what this really shows is that for estimation problems with multiple parameters, there are specific mathematical structures—like rotational covariance—that let us find strategies better than what we'd get from just looking at each parameter separately.
Mira: It confirms that the Bayesian Nagaoka-Hayashi bound is a much tighter lower limit than the symmetric logarithmic derivative bounds they mentioned earlier, and it’s worth focusing on those kinds of bounds when you have multiple parameters to estimate.
Lev: And remember, while they proved it for this channel family, we still have to figure out if that attainment holds up when we try to apply this whole framework to different types of noise or more complicated quantum operations.
Kai: So the practical implication is that if you are designing a quantum sensor where you need high precision across multiple settings, knowing how your optimal probe state changes with noise, and having a method that can find the best measurement setup using these SDPs, gives you a much clearer path forward.
Conclusion: Kai: So, to wrap up, this paper on "Saturating the Bayesian Nagaoka–Hayashi bound within numerical precision for the depolarization SU(two) rotation channel" proves that we can actually build a strategy for estimating three parameters simultaneously under noise that gets numerically as good as possible.
Mira: It shows that by using rotational covariance to turn it into these small semidefinite programs, we can find an estimation plan that hits the lower limit of the Bayesian Nagaoka–Hayashi bound, even when the noise is high.
Lev: From my side, it’s important to remember that this is a numerical demonstration for this specific SU(two) rotation channel; we still need to figure out if it holds up when we try to apply this whole framework to different types of noise or more parameters than just three.
Kai: Right. The main thing is that the optimal probe state collapses into a tensored Bell state as the noise grows, which gives us a concrete idea for what kind of entangled resource we need to prepare if we want this method to work in practice under more demanding conditions.
Mira: It's pretty strong evidence that symmetry reduction techniques are really useful tools for tackling these multiparameter estimation problems by turning them into manageable semidefinite programs.
Lev: I just think the main hurdle is translating those abstract SDP solutions into physical operations on real hardware, which is where the overhead really lands.
Kai: So, we’re leaving this paper with the idea that for specific channel families, like this depolarizing one, we have a numerical benchmark to aim for when designing estimation strategies.
Mira: It sets a good standard because it shows how much better the Bayesian Nagaoka–Hayashi bound is compared to those symmetric logarithmic derivative bounds when you have multiple parameters.
Lev: And remember, while they proved it for this channel family, we still have that open question about whether this attainment holds up when you move away from this simple SU(two) rotation and introduce more complex noise models or more parameters.
Kai: We'll keep an eye on how these covariant methods apply to other non-commuting observables and how they handle those larger parameter sets in the next batch of papers.
Wyant College of Optical Sciences, University of Arizona · Department of Electrical and Computer Engineering, University of Arizona · Program in Applied Mathematics, University of Arizona
quant-ph
Submitted: 2026-07-16
Updated: 2026-11-05
Comments: 8 Pages, 2 Figure
DOI: 10.1103/p7vp-vyxf
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 88/100
The gist: The Bayesian Nagaoka–Hayashi (NH) bound is a semidefinite lower bound on the Bayes risk of multiparameter estimation…
Key concepts
- Bayesian Nagaoka–Hayashi (NH) bound
- This is a semidefinite lower bound on the Bayes risk for estimating multiple parameters in quantum systems. It is tighter than other known bounds and the study shows that this specific bound can actually be achieved by an optimal estimation strategy.
- Bayes Risk ($ar{ ho}$)
- The Bayes risk measures the expected error when estimating unknown parameters based on measurement outcomes. The goal is to minimize this risk, which depends on the chosen probe state and measurement strategy.
- Depolarizing Noise
- This is a type of noise applied to quantum channels that reduces the purity of a quantum state. It models how much information is lost or corrupted during the transmission through the channel, affecting estimation accuracy.
- Semidefinite Programming (SDP)
- SDP is a mathematical tool used to solve complex optimization problems in quantum estimation. The paper uses SDPs to find the best possible combination of probe states, measurements, and estimators for multiparameter estimation.
Terminology
Summary
The Bayesian Nagaoka–Hayashi (NH) bound is a semidefinite lower bound on the Bayes risk of multiparameter estimation, tighter than the Bayesian symmertic logarithmic derivative (SLD) Cram´er–Rao bounds, and whether it can be attained is an open problem. p. 0 This study investigates the single-shot estimation of a qubit rotation with all three parameters under depolarizing noise and a uniform prior using k parallel uses of the channel. p. 0 The optimized strategy reaches the NH bound within numerical precision, providing evidence that this bound is attained for this channel family, while the SLD bound lies strictly below it. p. 0
Bayesian Estimation Framework
The estimation problem involves estimating a set of unknown parameters θ = (θ1,..., θd) that label a family of completely positive and trace-preserving channels Λθ. p. 1 A probe ρ0 is sent through the channel to produce the output state ρ(θ) = Λθ[ρ0], and a measurement described by a POVM returns outcome m with likelihood p(mθ) = Tr[Mm ρ(θ)]. p. 1 The figure of merit is the weighted Bayesian mean square error (MSE) ϵ¯, which depends on the strategy through the output family ρ(θ) and the POVM. p. 1 For a fixed measurement, the optimal estimates are defined as the posterior means ˆθi(m) = R dθ p(θm) θi. p. 1
Bounds on Bayes Risk
Lower bounds on the Bayes risk include the SLD bound, which is given by ϵ¯SLD = ¯ϵprior − X d i=1 wi TrΓˆ0L2i. The Nagaoka–Hayashi bound is tighter than Eq. p. 0 (6), and the risk of any strategy equals ϵ¯ = Tr[S L¯] − Tr[DX¯ ⊺] − Tr[XD¯ ⊺] + ¯ϵprior. p. 2 The inequality between the bounds is ordered as [2607. p. 2153983pg9] ϵ¯SLD ≤ ϵ¯NH ≤ ϵ¯⋆ ≤ ϵ¯prior, where ¯ϵ⋆ is the exact optimum of Eq. p. 2 (2) for a given probe. p. 2
Symmetry Reduction and Optimization
The problem is reduced to small semidefinite programs by using the rotational covariance of the problem, which reduces the joint optimization over probe, measurement, and estimator over k parallel channel uses to SDPs solvable through k = 4. Rotational covariance allows strategies obeying T(Rθˆ) = WR T(θˆ) W†R with the estimate as the outcome label to be found, where the completeness condition involves a seed operator. p. 3 The Haar twirl averages the covariant family over directions, reducing constraints to C2k linear equations relating seed blocks to σ. p. 3 Minimizing Eq. p. 3 (23) over the blocks Ξm(ˆr) ≥ 0 under these reduced completeness equations yields the strategy SDP. p. 3
Numerical Evidence and Conclusion
The optimized strategy reaches the NH bound within numerical precision at every computed number of uses and noise strength, which serves as a numerical observation rather than an attainment theorem. As depolarization grows, the optimal probe collapses to the tensored Bell state. p. 1 The near coincidence of an achievable risk with the lower bound provides numerical evidence that the NH bound is attained for this channel family at every accessible k. p. 4 The optimized probe itself collapses to the tensored Bell state when noise grows, visible in Figure 1. p. 0
References
[1] V. Giovannetti, S. p. 5 Lloyd, and L. p. 5 Maccone, Advances in quantum metrology
[2] C. W. Helstrom, Minimum mean-squared error of estimates in quantum statistics
[3] S. L. Braunstein and C. p. 5 M. Caves, Statistical distance and the geometry of quantum states
[4] R. Demkowicz-Dobrza´nski, W. p. 5 G´orecki, and M. p. 5 Gut¸˘a, Multi-parameter estimation beyond quantum fisher information
[5] J. S. Sidhu and P. p. 5 Kok, Geometric perspective on quantum parameter estimation
[6] C. Helstrom and R. p. 5 Kennedy, Noncommuting observables in quantum detection and estimation theory
[7] S. Ragy, M. Jarzyna, and R. p. 5 Demkowicz-Dobrza´nski, Compatibility in multiparameter quantum metrology
[8] H. Yuen and M. p. 5 Lax, Multiple-parameter quantum estimation and measurement of nonselfadjoint observables
[9] A. S. Holevo, Probabilistic and statistical aspects of quantum theory, Vol. p. 5 1
[10] M. Tsang, The holevo cram´er-rao bound is at most thrice the helstrom version
[11] J. Kahn and M. p. 5 Gut¸˘a, Local asymptotic normality for finite dimensional quantum systems
[12] K. Yamagata, A. p. 5 Fujiwara, and R. p. 5 D. Gill, Quantum local asymptotic normality based on a new quantum likelihood ratio
[13] Y. Yang, G. Chiribella, and M. p. 5 Hayashi, Attaining the ultimate precision limit in quantum state estimation
[14] H. Nagaoka, On the parameter estimation problem for quantum statistical models
[15] H. Nagaoka, A generalization of the simultaneous diagonalization of hermitian matrices and its relation to quantum estimation theory
[16] M. Hayashi, On simultaneous measurement of noncommutative observables, Development of infinitedimensional non-commutative anaysis
[17] L. O. Conlon, J. Suzuki, P. K. Lam, and S. p. 5 M. Assad, Efficient computation of the nagaoka–hayashi bound for multiparameter estimation with separable measurements
[18] M. Hayashi and Y. p. 0 p. 0 Ouyang, Tight cram´er-rao type bounds for multiparameter quantum metrology through conic programming
[19] M. Hayashi and Y. Ouyang, Finding the optimal probe state for multiparameter quantum metrology using conic programming
[20] S. Personick, Application of quantum estimation theory to analog communication over quantum channels
[21] A. S. Holevo, Statistical decision theory for quantum systems
[22] M. Tsang, Ziv-zakai error bounds for quantum parameter estimation
[23] X.-M. Lu and M. Tsang, Quantum weiss-weinstein bounds for quantum metrology
[24] M. Tsang, Physics-inspired forms of the bayesian cram´errao bound
[25] J. Rubio and J. p. 0 Dunningham, Bayesian multiparameter quantum metrology with limited data
[26] J. Suzuki, Bayesian nagaoka-hayashi bound for multiparameter quantum-state estimation problem
[27] F. Albarelli, D. p. 6 Branford, and J. p. 6 Rubio, Measurement incompatibility in bayesian multiparameter quantum estimation
[28] A. Ac´ın, E. p. 6 Jan´e, and G. p. 6 Vidal, Optimal estimation of quantum dynamics
[29] G. Chiribella, G. p. 5 p. 5 p. 5 p. 5 D’ariano, and M. p. 6 F. Sacchi, Optimal estimation of group transformations using entanglement
[30] E. Bagan, M. Baig, and R. p. 6 Munoz-Tapia, Entanglementassisted alignment of reference frames using a dense covariant coding
[31] R. Demkowicz-Dobrza´nski, Optimal phase estimation with arbitrary a priori knowledge
[32] G. Gutoski and J. p. 6 Watrous, Toward a general theory of quantum games
[33] M. Ziman, Process positive-operator-valued measure: A mathematical framework for the description of process tomography experiments
[34] G. Chiribella, G. M. D’Ariano, and P. p. 6 p. 6 p. 6 Perinotti, Quantum circuit architecture
[35] G. Chiribella, G. M. D’Ariano, and P. Perinotti, Memory effects in quantum channel discrimination
[36] G. Chiribella, G. M. D’Ariano, and P. Perinotti, Theoretical framework for quantum networks
[37] J. Bavaresco, P. p. 6 Lipka-Bartosik, P. p. 6 Sekatski, and M. p. 6 Mehboudi, Designing optimal protocols in bayesian quantum parameter estimation with higher-order operations
[38] E. L. Andr´e, J. p. 6 Bavaresco, and M. p. 6 Mehboudi, Strategy optimization for bayesian quantum parameter estimation with finite copies: Adaptive greedy, parallel, sequential, and general strategies
[39] L. Vandenberghe and S. p. 6 Boyd, Semidefinite programming
[40] C. Bachoc, D. C. Gijswijt, A. p. 6 Schrijver, and F. p. 6
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Optimization of probe, measurement, and estimator for multiparameter estimation can be performed by reducing it to semidefinite programs whose sizes are set by representation multiplicities, solvable through k equals 4. This allows for a tractable strategy search in complex quantum sensing tasks.
-
The system can reach the Bayesian Nagaoka Hayashi bound within the numerical precision of the calculation at every computed number of uses and noise strength, providing a verifiable benchmark for estimation strategies.
-
The optimal probe can collapse to the tensored Bell state as depolarization grows, which informs resource allocation strategies under increasing channel noise.
Sources
- The Holevo Cram'er-Rao bound is at most thrice the Helstrom version
- Measurement incompatibility in Bayesian multiparameter quantum estimation
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements