Quantum Channel Certification with Incoherent Strategies

03/02/2023
by   Omar Fawzi, et al.
0

In the problem of quantum channel certification, we have black box access to a quantum process and would like to decide if this process matches some predefined specification or is ε-far from this specification. The objective is to achieve this task while minimizing the number of times the black box is used. Here, we focus on optimal incoherent strategies for two relevant extreme cases of channel certification. The first one is when the predefined specification is a unitary channel, e.g., a gate in a quantum circuit. In this case, we show that testing whether the black box is described by a fixed unitary operator in dimension d or ε-far from it in the trace norm requires Θ(d/ε^2) uses of the black box. The second setting we consider is when the predefined specification is a completely depolarizing channel with input dimension d_in and output dimension d_out. In this case, we prove that, in the non-adaptive setting, Θ̃(d_in^2d_out^1.5/ε^2) uses of the channel are necessary and sufficient to verify whether it is equal to the depolarizing channel or ε-far from it in the diamond norm. Finally, we prove a lower bound of Ω(d_in^2d_out/ε^2) for this problem in the adaptive setting. Note that the special case d_in = 1 corresponds to the well-studied quantum state certification problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2022

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

We show that quantum states with "low stabilizer complexity" can be effi...
research
05/13/2020

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits

Virtual black-box obfuscation is a strong cryptographic primitive: it en...
research
01/22/2023

Lower Bounds on Learning Pauli Channels

Understanding the noise affecting a quantum device is of fundamental imp...
research
03/20/2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds

We investigate the existence of constant-round post-quantum black-box ze...
research
10/12/2022

Unitary property testing lower bounds by polynomials

We study unitary property testing, where a quantum algorithm is given qu...
research
08/07/2020

Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints

The main focus of this paper is radius-based clustering problems in the ...
research
02/21/2023

There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups

Let Ω be a finite set of finitary operation symbols and let 𝔙 be a nontr...

Please sign up or login with your details

Forgot password? Click here to reset