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

Estimation of n non-identical unitary channels

Caleb J O'Loan

Published Feb 8, 2008• 0 citations
arXivHTMLPDF

Abstract

We investigate the simultaneous estimation of $n$ not necessarily identical unitary channels using multi-partite entanglement. We examine whether it is possible for the rate at which the mean square error decreases to be greater than that using the channels individually. For a reasonably general situation, in which there is no functional dependence between the channels, we show that this is not possible. We look at a case in which the channels are not necessarily identical but depend on a common variable. In this case, the mean square error decreases more rapidly using multi-partite entanglement.

DOI
10.48550/arxiv.0802.1181

Related papers

Estimation of SU(d) using entanglement

Manuel A. Ballester

The problem of estimating an SU(d) quantum operation when has N copies of it available at the same time is considered. The problem has been considered recently by several authors for d=2 and they obtain an estimation strategy for which the mean square error vanishes at 1/N^2 rate. In this paper results in that direction are obtained for the general d case.

•Jul 7, 2005•4 citations

Quantum estimation of coupled parameters and the role of entanglement

Pieter Kok, Jacob Dunningham, JF Ralph

The quantum Cramer-Rao bound places a limit on the mean square error of a parameter estimation procedure, and its numerical value is determined by the quantum Fisher information. For single parameters, this leads to the well- known Heisenberg limit that surpasses the classical shot-noise limit. When estimating multiple parameters, the situation is more complicated and the quantum Cramer-Rao bound is generally not attainable. In such cases, the use of entanglement typically still offers an enhancement in precision. Here, we demonstrate that entanglement is detrimental when estimating some nuisance parameters. In general, we find that the estimation of coupled parameters does not benefit from either classical or quantum correlations. We illustrate this effect in a practical application for optical gyroscopes.

•Jan 1, 2000•0 citations

Multiparty Zero-Error Classical Channel Coding With Entanglement

Teresa Piovesan, Giannicola Scarpa, Christian Schaffner

We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.

arXiv:1403.5003•IEEE Transactions on Information Theory•Dec 10, 2014•4 citations

Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits

Jiachen Hu, Tongyang Li, Xinzhao Wang +3 more

We systematically investigate quantum algorithms and lower bounds for mean estimation given query access to non-identically distributed samples. On the one hand, we give quantum mean estimators with quadratic quantum speed-up given samples from different bounded or sub-Gaussian random variables. On the other hand, we prove that, in general, it is impossible for any quantum algorithm to achieve quadratic speed-up over the number of classical samples needed to estimate the mean $μ$, where the samples come from different random variables with mean close to $μ$. Technically, our quantum algorithms reduce bounded and sub-Gaussian random variables to the Bernoulli case, and use an uncomputation trick to overcome the challenge that direct amplitude estimation does not work with non-identical query access. Our quantum query lower bounds are established by simulating non-identical oracles by parallel oracles, and also by an adversarial method with non-identical oracles. Both results pave the way for proving quantum query lower bounds with non-identical oracles in general, which may be of independent interest.

arXiv:2405.12838•Leibniz international proceedings in informatics•Jan 1, 2024•1 citation

Estimation of unitary quantum operations

Manuel A. Ballester

The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts, and then measure the joint output state. This measurement could be an entangled one or it could be separable (e.g., measurements which can be implemented with local operations and classical communication or LOCC). A comparison is made between these possibilities and it is shown that by using nonseparable measurements one can improve the accuracy of the estimation by a factor of $2(d+1)/d$ where d is the dimension of the Hilbert space on which U acts.

arXiv:quant-ph/0305104•Physical Review A•Feb 5, 2004•73 citations

On metric of quantum channel spaces

Keiji Matsumoto

So far, there have been plenty of literatures on the metric in the space of probability distributions and quantum states. As for channels, however, only a little had been known. In this paper, we impose monotonicity by concatenation of channels before and after the given channel families, and invariance by tensoring identity channels. Under these axioms, we identify the largest and the smallest metrics. Also, we studied asymptotic theory of metric in parallel and adaptive repetition settings, and applied them to the study of channel estimation. First we express the achievable lower bound of the mean square error (MSE) of an estimate by a monotone channel metric, and show this equals O(1/n) for noisy channels, where n is the number of times of channel use. This result shows Heisenberg rate, or O(1/n^2)-rate of the MSE observed in case of estimation of unitary, collapses with very small arbitrary noise.

arXiv:1006.0300•Jun 2, 2010•23 citations
We investigate the simultaneous estimation of nnn not necessarily identical unitary channels using multi-partite entanglement. We examine whether it is possible for the rate at which the mean square error decreases to be greater than that using the channels individually. For a reasonably general situation, in which there is no functional dependence between the channels, we show that this is not possible. We look at a case in which the channels are not necessarily identical but depend on a common variable. In this case, the mean square error decreases more rapidly using multi-partite entanglement.
The quantum Cramer-Rao bound places a limit on the mean square error of a parameter estimation procedure, and its numerical value is determined by the quantum Fisher information. For single parameters, this leads to the well- known Heisenberg limit that surpasses the classical shot-noise limit. When estimating multiple parameters, the situation is more complicated and the quantum Cramer-Rao bound is generally not attainable. In such cases, the use of entanglement typically still offers an enhancement in precision. Here, we demonstrate that entanglement is detrimental when estimating some nuisance parameters. In general, we find that the estimation of coupled parameters does not benefit from either classical or quantum correlations. We illustrate this effect in a practical application for optical gyroscopes.
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a one-way classical noisy channel. If the two parties are allowed to share entanglement, there are several positive results that show the existence of channels for which they can communicate strictly more than what they could do with classical resources. In the first task, one sender wants to communicate a common message to multiple receivers. We show that if the number of receivers is greater than a certain threshold then entanglement does not allow for an improvement in the communication for any finite number of uses of the channel. On the other hand, when the number of receivers is fixed, we exhibit a class of channels for which entanglement gives an advantage. The second problem we consider features multiple collaborating senders and one receiver. Classically, cooperation among the senders might allow them to communicate on average more messages than the sum of their individual possibilities. We show that whenever a channel allows single-sender entanglement-assisted advantage, then the gain extends also to the multisender case. Furthermore, we show that entanglement allows for a peculiar amplification of information which cannot happen classically, for a fixed number of uses of the channels.
We systematically investigate quantum algorithms and lower bounds for mean estimation given query access to non-identically distributed samples. On the one hand, we give quantum mean estimators with quadratic quantum speed-up given samples from different bounded or sub-Gaussian random variables. On the other hand, we prove that, in general, it is impossible for any quantum algorithm to achieve quadratic speed-up over the number of classical samples needed to estimate the mean μμμ, where the samples come from different random variables with mean close to μμμ. Technically, our quantum algorithms reduce bounded and sub-Gaussian random variables to the Bernoulli case, and use an uncomputation trick to overcome the challenge that direct amplitude estimation does not work with non-identical query access. Our quantum query lower bounds are established by simulating non-identical oracles by parallel oracles, and also by an adversarial method with non-identical oracles. Both results pave the way for proving quantum query lower bounds with non-identical oracles in general, which may be of independent interest.
The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts, and then measure the joint output state. This measurement could be an entangled one or it could be separable (e.g., measurements which can be implemented with local operations and classical communication or LOCC). A comparison is made between these possibilities and it is shown that by using nonseparable measurements one can improve the accuracy of the estimation by a factor of 2(d+1)/d2(d+1)/d2(d+1)/d where d is the dimension of the Hilbert space on which U acts.
So far, there have been plenty of literatures on the metric in the space of probability distributions and quantum states. As for channels, however, only a little had been known. In this paper, we impose monotonicity by concatenation of channels before and after the given channel families, and invariance by tensoring identity channels. Under these axioms, we identify the largest and the smallest metrics. Also, we studied asymptotic theory of metric in parallel and adaptive repetition settings, and applied them to the study of channel estimation. First we express the achievable lower bound of the mean square error (MSE) of an estimate by a monotone channel metric, and show this equals O(1/n) for noisy channels, where n is the number of times of channel use. This result shows Heisenberg rate, or O(1/n^2)-rate of the MSE observed in case of estimation of unitary, collapses with very small arbitrary noise.