Test One to Test Many: A Unified Approach to Quantum Benchmarks

Bai, Guoqiang; Chiribella, Giulio

doi:10.1103/physrevlett.120.150502

Cited by 12 publications

(34 citation statements)

References 61 publications

(113 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we present one of the main results in [29]. As the combination ofσ AR and O A R ¢ is not unique, an experimentally feasible input state σ AR is preferred.…”

Section: Benchmarking Quantum Channelsmentioning

confidence: 96%

“…where, ifx is an uncountable set, å must be replaced by ò . Now we discuss a benchmark test, proposed in [29], which requires only one input state and measurements of one observable. Rather than sampling different inputs ρ x , any benchmark test can be reformulated into a new test that requires only the preparation of one input state σ AR and the measurement of one observable O A R ¢ by adding a reference systemR, where A and A′ denote channel input and channel output, respectively.…”

Section: Benchmarking Quantum Channelsmentioning

confidence: 99%

“…where  is the identity channel on referenceR. σ AR and O A R ¢ in equation (37) are not unique: different combinations of input σ AR and observable O A R ¢ lead to equivalent tests iff they yield the same performance operator [29], which is defined below.…”

Section: Benchmarking Quantum Channelsmentioning

confidence: 99%

“…Reference [29] has shown the results in lemma 7, except missing the constant tanh 2 q¢ in equation (68). The proof of this lemma is in appendix A. Lemma 7 implies that by applying two-mode squeezing and measuring G θ at one mode, the verifier can directly estimate the average fidelity.…”

Section: Verification Of Multi-mode Gaussian Unitary Channelsmentioning

confidence: 99%

“…An experimentally appealing adaptation [25] of recent verification schemes [18,24] only estimates average fidelity over a finite-dimensional subspace chosen by selecting a finite set of coherent states. This subspace selection cannot assess quantum-channel performance over the entire infinite-dimensional Hilbert space H. In contrast, the alternative scheme [29] is challenged by experimental limitations: online squeezing, which squeezes any state known or unknown [30,31], and quantum memories [32,33]. Here we combine the favorable features of the state verification approach [18] and the unified quantum-benchmark approach [29] to develop our verification schemes for bosonic channels.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient verification of bosonic quantum channels via benchmarking

Sanders

2019

New J. Phys.

View full text Add to dashboard Cite

We aim to devise feasible, efficient verification schemes for bosonic channels. To this end, we construct an average-fidelity witness that yields a tight lower bound for average fidelity plus a general framework for verifying optimal quantum channels. For both multi-mode unitary Gaussian channels and single-mode amplification channels, we present experimentally feasible average-fidelity witnesses and reliable verification schemes, for which sample complexity scales polynomially with respect to all channel specification parameters. Our verification scheme provides an approach to benchmark the performance of bosonic channels on a set of Gaussian-distributed coherent states by employing only two-mode squeezed vacuum states and local homodyne detections. Our results demonstrate how to perform feasible tests of quantum components designed for continuous-variable quantum information processing.

show abstract

“…Here we present one of the main results in [29]. As the combination ofσ AR and O A R ¢ is not unique, an experimentally feasible input state σ AR is preferred.…”

Section: Benchmarking Quantum Channelsmentioning

confidence: 96%

Section: Benchmarking Quantum Channelsmentioning

confidence: 99%

Section: Benchmarking Quantum Channelsmentioning

confidence: 99%

Section: Verification Of Multi-mode Gaussian Unitary Channelsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient verification of bosonic quantum channels via benchmarking

Sanders

2019

New J. Phys.

View full text Add to dashboard Cite

show abstract

Quantum communication protocols as a benchmark for programmable quantum computers

Жуков

Kiktenko

Elistratov

et al. 2018

Quantum Inf Process

View full text Add to dashboard Cite

We point out that realization of quantum communication protocols in programmable quantum computers provides a deep benchmark for capabilities of real quantum hardware. Particularly, it is prospective to focus on measurements of entropy-based characteristics of the performance and to explore whether a "quantum regime" is preserved. We perform proof-of-principle implementations of superdense coding and quantum key distribution BB84 E. O. K. was supported by ). W. V. P. acknowledges a support from RFBR (project no. 15-02-02128). Yu. E. L. acknowledges a support from RFBR (project no. 17-02-01134) and the Program of Basic Research of HSE. arXiv:1812.00587v1 [quant-ph] 3 Dec 2018 2 A. A. Zhukov et al.using 5-and 16-qubit superconducting quantum processors of IBM Quantum Experience. We focus on the ability of these quantum machines to provide an efficient transfer of information between distant parts of the processors by placing Alice and Bob at different qubits of the devices. We also examine the ability of quantum devices to serve as quantum memory and to store entangled states used in quantum communication. Another issue we address is an error mitigation. Although it is at odds with benchmarking, this problem is nevertheless of importance in a general context of quantum computation with noisy quantum devices. We perform such a mitigation and noticeably improve some results.Keywords quantum computer, quantum communication protocol, quantum algorithms, superdense coding, quantum benchmark IntroductionQuantum technologies based on manipulation with individual quantum objects and their quantum states are of great interest in problems of information transfer and processing. Historically, one of the first applications of quantum information technologies was quantum communication, and particularly, quantum key distribution (QKD) [1]. This technology utilizes features of quantum light in order to provide information-theoretic (unconditional) security for classical data transmission and storage [2,3]. Nowadays, there is a significant progress in experiments for providing long-distance point-to-point QKD links [4,5,6], as well as establishing multi-site quantum networks [7,8,9,10]. There are also other important developing areas of quantum communication such as secure direct communication [11,12,13], based on use of superdense coding [14], and transfering quantum states with quantum teleportation [15,16].Another field, which is undergoing dramatic progress, is quantum computation with different physical platforms, among which superconducting quantum circuits as well as trapped ions seem to be most prospective, see, e.g., Refs. [17,18]. Various quantum algorithms have been implemented to show concepts of error correction [19,20,21,22,23], modeling spectra of molecules [24] and other fermionic systems [25], simulation of light-matter systems [26], spin systems [27], many-body localization [28], machine learning [29], scaling issues [30] etc. However, in order to realize algorithms which are of practical importance, the quantum...

show abstract

The nonequilibrium cost of accurate information processing

et al. 2022

Self Cite

View full text Add to dashboard Cite

Accurate information processing is crucial both in technology and in nature. To achieve it, any information processing system needs an initial supply of resources away from thermal equilibrium. Here we establish a fundamental limit on the accuracy achievable with a given amount of nonequilibrium resources. The limit applies to arbitrary information processing tasks and arbitrary information processing systems subject to the laws of quantum mechanics. It is easily computable and is expressed in terms of an entropic quantity, which we name the reverse entropy, associated to a time reversal of the information processing task under consideration. The limit is achievable for all deterministic classical computations and for all their quantum extensions. As an application, we establish the optimal tradeoff between nonequilibrium and accuracy for the fundamental tasks of storing, transmitting, cloning, and erasing information. Our results set a target for the design of new devices approaching the ultimate efficiency limit, and provide a framework for demonstrating thermodynamical advantages of quantum devices over their classical counterparts.

show abstract

Test One to Test Many: A Unified Approach to Quantum Benchmarks

Cited by 12 publications

References 61 publications

Efficient verification of bosonic quantum channels via benchmarking

Efficient verification of bosonic quantum channels via benchmarking

Quantum communication protocols as a benchmark for programmable quantum computers

The nonequilibrium cost of accurate information processing

Contact Info

Product

Resources

About