Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum certification of state set and unitary channel
124
0
0.0
(
0
)
Authors
Wei Xie
Ask ChatGPT about the research
No Arabic abstract
We study efficient quantum certification algorithms for quantum state set and unitary quantum channel. We present an algorithm that uses $O(varepsilon^{-4}ln |mathcal{P}|)$ copies of an unknown state to distinguish whether the unknown state is contained in or $varepsilon$-far from a finite set $mathcal{P}$ of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. Previous study showed that one can distinguish whether an unknown unitary $U$ is equal to or $varepsilon$-far from a known or unknown unitary $V$ in fixed dimension with $O(varepsilon^{-2})$ uses of the unitary, in which the Choi state is used and thus an ancilla system is needed. We give an algorithm that distinguishes the two cases with $O(varepsilon^{-1})$ uses of the unitary, using much fewer or no ancilla compared with previous results.
rate research
Read More
Concomitant with the rapid development of quantum technologies, challenging demands arise concerning the certification and characterization of devices. The promises of the field can only be achieved if stringent levels of precision of components can be reached and their functioning guaranteed. This review provides a brief overview of the known characterization methods of certification, benchmarking, and tomographic recovery of quantum states and processes, as well as their applications in quantum computing, simulation, and communication.
Standard Bayesian credible-region theory for constructing an error region on the unique estimator of an unknown state in general quantum-state tomography to calculate its size and credibility relies on heavy Monte~Carlo sampling of the state space followed by sample rejection. This conventional method typically gives negligible yield for very small error regions originating from large datasets. We propose an operational reformulated theory to compute both size and credibility from region-average quantities that in principle convey information about behavior of these two properties as the credible-region changes. We next suggest the accelerated hit-and-run Monte~Carlo sampling, customized to the construction of Bayesian error-regions, to efficiently compute region-average quantities, and provide its complexity estimates for quantum states. Finally by understanding size as the region-average distance between two states in the region (measured for instance with either the Hilbert-Schmidt, trace-class or Bures distance), we derive approximation formulas to analytically estimate both distance-induced size and credibility under the pseudo-Bloch parametrization without resorting to any Monte~Carlo computation.
Recently [Cavalcanti textit{et al.} Nat Commun textbf{6}, 7941 (2015)] proposed a method to certify the presence of entanglement in asymmetric networks, where some users do not have control over the measurements they are performing. Such asymmetry naturally emerges in realistic situtations, such as in cryptographic protocols over quantum networks. Here we implement such semi-device independent techniques to experimentally witness all types of entanglement on a three-qubit photonic W state. Furthermore we analise the amount of genuine randomness that can be certified in this scenario from any bipartition of the three-qubit W state.
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta(d^{(k+1)/2}) for 0-certificates, and Theta(d^{k/2}) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is O(d^{(k+1)/2}) (again neglecting a logarithmic factor). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem.
We investigate the optimal quantum state reconstruction from cloud to many spatially separated users by measure-broadcast-prepare scheme without the availability of quantum channel. The quantum state equally distributed from cloud to arbitrary number of users is generated at each port by ensemble of known quantum states with assistance of classical information of measurement outcomes by broadcasting. The obtained quantum state for each user is optimal in the sense that the fidelity universally achieves the upper bound. We present the universal quantum state distribution by providing physical realizable measurement bases in the cloud as well as the reconstruction method for each user. The quantum state reconstruction scheme works for arbitrary many identical pure input states in general dimensional system.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
