A quantum state transformation can be generally approximated by single- and two-qubit gates. This, however, does not hold with noisy intermediate-scale quantum technologies due to the errors appearing in the gate operations, where errors of two-qubit gates such as controlled-NOT and SWAP operations are dominated. In this work, we present a cost efficient single-copy certification for a realization of a two-qubit gate in the presence of depolarization noise, where it is aimed to identify if the realization is noise-free, or not. It is shown that entangled resources such as entangled states and a joint measurement are not necessary for the purpose, i.e., a noise-free two-qubit gate is not needed to certify an implementation of a two-qubit gate. A proof-of-principle demonstration is presented with photonic qubits.
Self-testing protocols are methods to determine the presence of shared entangled states in a device independent scenario, where no assumptions on the measurements involved in the protocol are made. A particular type of self-testing protocol, called parallel self-testing, can certify the presence of copies of a state, however such protocols typically suffer from the problem of requiring a number of measurements that increases with respect to the number of copies one aims to certify. Here we propose a procedure to transform single-copy self-testing protocols into a procedure that certifies the t…
The Power of Two Bases: Robust and copy-optimal certification of nearly all quantum states with few-qubit measurements
Paul G. Allen School of Computer Science and Engineering, University of Washington（华盛顿大学保罗·G·艾伦计算机科学与工程学系）；Massachusetts Institute of Technology（麻省理工学院）
Not all quantum protocols require entanglement to outperform their classical alternatives. The nonclassical correlations that lead to this quantum advantage are conjectured to be captured by quantum discord. Here we demonstrate that discord can be explicitly used as a resource: certifying untrusted entangling gates without generating entanglement at any stage. We implement our protocol in the single-photon regime, and show its success in the presence of high levels of noise and imperfect gate operations. Our technique offers a practical method for benchmarking entangling gates in physical arch…
We demonstrate to what extent many copies of maximally entangled two-qubit states enable for generating a greater amount of certified randomness than that can be certified from a single copy. Although it appears that greater the dimension of the system implies a higher amount of randomness, the non-triviality lies in the device-independent simultaneous certification of generated randomness from many copies of entangled states. This is because, most of the two-outcome Bell inequalities (viz., Clauser-Horne-Shimony-Holt, Elegant, or Chain Bell inequality) are optimized for a single copy of two-q…
We introduce witnesses for the average channel fidelity between a known target gate and an arbitrary unknown channel, for continuous-variable (CV) systems. These are observables whose expectation value yields a tight lower bound to the average channel fidelity in question, thus constituting a practical tool for certification of experimental CV gates. Our framework applies to a broad class of target gates. Here, we focus on three specific types of targets: multi-mode Gaussian unitary channels, single-mode coherent state amplifiers, and the single-mode (non-Gaussian) cubic phase gate, which is a…
Robust Device-Independent Certification of Boolean-Phase Gates
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics（南京航空航天大学计算机科学与技术学院）；Faculty of Physics, University of Belgrade（贝尔格莱德大学物理学院）
Activation of Bell nonlocality refers to the phenomenon that some entangled mixed states that admit a local hidden variable model in the standard Bell scenario nevertheless reveal their nonlocal nature in more exotic measurement scenarios. We present such a scenario that involves broadcasting the local subsystems of a single-copy of a bipartite quantum state to multiple parties, and use the scenario to study the nonlocal properties of the two-qubit isotropic state: \begin{align} \nonumber ρ_α= α\,|Φ^+ \rangle\langle Φ^+|+(1-α)\frac{\mathbb{1}}{4}. \end{align} We present two main results, consi…
Due to the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the computation process via quantum process tomography requires an exponential amount of resources, and thus is not practical even for relatively small devices. We solve this problem by demonstrating that twirling experiments previously used to characterize the average fidelity of quantum memories efficiently can be easily adapted to estimate the average fidelity of the e…
Experimental implementations of quantum information processing have now reached a level of sophistication where quantum process tomography is impractical. The number of experimental settings as well as the computational cost of the data post-processing now translates to days of effort to characterize even experiments with as few as 8 qubits. Recently a more practical approach to determine the fidelity of an experimental quantum process has been proposed, where the experimental data is compared directly to an ideal process using Monte Carlo sampling. Here we present an experimental implementati…
We consider the problem of quantum state certification, where one is given $n$ copies of an unknown $d$-dimensional quantum mixed state $ρ$, and one wants to test whether $ρ$ is equal to some known mixed state $σ$ or else is $ε$-far from $σ$. The goal is to use notably fewer copies than the $Ω(d^2)$ needed for full tomography on $ρ$ (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using $n = O(d/ε)$ copies, and one with respect to trace distance using $n = O(d/ε^2)$ copies. The latter algorithm also applies when $σ$ is unknown as well.…
Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. Steady progress vis-à-vis verification of quantum devices in the scenario with fully characterized measurement devices has been observed in recent years. When it comes to the scenario with uncharacterized measurements, the so-called black-box scenario, practical verification methods are still rather scarce. Development of self-testing methods is an important step forward, but these results so far have been used for reliable verification only by considering the as…
We consider the problem of quantum state certification, where we are given the description of a mixed state $σ\in \mathbb{C}^{d \times d}$, $n$ copies of a mixed state $ρ\in \mathbb{C}^{d \times d}$, and $\varepsilon > 0$, and we are asked to determine whether $ρ= σ$ or whether $\| ρ- σ\|_1 > \varepsilon$. When $σ$ is the maximally mixed state $\frac{1}{d} I_d$, this is known as mixedness testing. We focus on algorithms which use incoherent measurements, i.e. which only measure one copy of $ρ$ at a time. Unlike those that use entangled, multi-copy measurements, these can be implemented without…
We consider testing the ability of quantum network nodes to execute multi-round quantum protocols. Specifically, we examine protocols in which the nodes are capable of performing quantum gates, storing qubits and exchanging said qubits over the network a certain number of times. We propose a simple ping-pong test, which provides a certificate for the capability of the nodes to run certain multi-round protocols. We first show that in the noise-free regime the only way the nodes can pass the test is if they do indeed possess the desired capabilities. We then proceed to consider the case where op…
Ensuring the correct functioning of quantum error correction (QEC) circuits is crucial to achieve fault tolerance in realistic quantum processors subjected to noise. The first checkpoint for a fully operational QEC circuit is to create genuine multipartite entanglement across all subsystems of physical qubits. We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) that is efficient in the number of subsystems and, importantly, robust against experimental noise and imperfections. Specifically, we prove that the detection of entanglement in a linear nu…
We present a network consisting of quantum gates which produces two imperfect copies of an arbitrary qubit. The quality of the copies does not depend on the input qubit. We also show that for a restricted class of inputs it is possible to use a very similar network to produce three copies instead of two. For qubits in this class, the copy quality is again independent of the input and is the same as the quality of the copies produced by the two-copy network.
Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
Institute for Quantum Physics, University of Hamburg（汉堡大学量子物理研究所）；Max Planck Institute for the Structure and Dynamics of Matter（马普物质结构与动力学研究所）；The Hamburg Centre for Ultrafast Imaging, University of Hamburg（汉堡大学超快成像中心）；Clarendon Laboratory, University of Oxford（牛津大学克拉伦登实验室）
While it is known that copying a quantum system does not increase the amount of information obtainable about the originals, it may increase the amount available in practice, when one is restricted to imperfect measurements. We present a detection scheme which using imperfect detectors, and possibly noisy quantum copying machines (that entangle the copies), allows one to extract more information from an incoming signal, than with the imperfect detectors alone. The case of single-photon detection with noisy, inefficient detectors and copiers (single controlled-NOT gates in this case) is investig…
Run-length certificates in quantum learning: sample complexity and noise thresholds
Institute for Convergence Research and Education in Advanced Technology, Yonsei University（延世大学先进技术与教育融合研究所）；Department of Quantum Information, Yonsei University（延世大学量子信息系）
We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n "copy" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin states, the resulting Hamiltonian involves n- and (n+1)-spin interactions. The case n=1 also corresponds to a quantum-computing controlled-NOT gate.
We present a method of optimizing recently designed protocols for implementing an arbitrary nonlocal unitary gate acting on a bipartite system. These protocols use only local operations and classical communication with the assistance of entanglement, and are deterministic while also being "one-shot", in that they use only one copy of an entangled resource state. The optimization is in the sense of minimizing the amount of entanglement used, and it is often the case that less entanglement is needed than with an alternative protocol using two-way teleportation.
The quantum Toffoli gate allows universal reversible classical computation. It is also an important primitive in many quantum circuits and quantum error correction schemes. Here we demonstrate the realization of a Toffoli gate with three superconducting transmon qubits coupled to a microwave resonator. By exploiting the third energy level of the transmon qubit, the number of elementary gates needed for the implementation of the Toffoli gate, as well as the total gate time can be reduced significantly in comparison to theoretical proposals using two-level systems only. We characterize the perfo…
The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed that one does not need to build a large scale universal quantum computer, a task which has proven extremely challenging. Intermediate quantum models that are easier to implement, but which also exhibit this quantum advantage over classical computers, have been proposed. In this work, we present a certification technique for such a sub-universal quantum server which only performs commuting gates and requires very lim…
In recent years, quantum computers and algorithms have made significant progress indicating the prospective importance of quantum computing (QC). Especially combinatorial optimization has gained a lot of attention as an application field for near-term quantum computers, both by using gate-based QC via the Quantum Approximate Optimization Algorithm and by quantum annealing using the Ising model. However, demonstrating an advantage over classical methods in real-world applications remains an active area of research. In this work, we investigate the robustness verification of ReLU networks, which…
Adaptivity is all you need: Optimal stabilizer learning using just single-copy measurements
Freie Universität Berlin（柏林自由大学）；Helmholtz-Zentrum Berlin für Materialien und Energie（亥姆霍兹柏林材料能源中心）；John A. Paulson School of Engineering and Applied Sciences, Harvard University（哈佛大学约翰·A·保尔森工程与应用科学学院）
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of $N$ approximate clones given $M$ initial exact copies, where $N>M$. We also consider strategies which interpolate between approximate and exact cloning. A tight inequality is obtained which expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit as $N{\to}{\infty}$, to …
Certifying fermionic Gaussian states (and a little more) with optimal precision dependence
The Institute for Fundamental Study (IF), Naresuan University（纳瑞苏安大学基础研究所）；Chula Intelligent and Complex Systems Center of Excellence, Department of Physics, Faculty of Science, Chulalongkorn University（朱拉隆功大学理学院物理系查拉智能与复杂系统卓越中心）；School of Physical and Mathematical Sciences, Nanyang Technological University（南洋理工大学物理与数学科学学院）
The problem of distinguishing two unitary transformations, or quantum gates, is analyzed and a function reflecting their statistical distinguishability is found. Given two unitary operations, $U_1$ and $U_2$, it is proved that there always exists a finite number $N$ such that $U_1^{\otimes N}$ and $U_2^{\otimes N}$ are perfectly distinguishable, although they were not in the single-copy case. This result can be extended to any finite set of unitary transformations. Finally, a fidelity for one-qubit gates, which satisfies many useful properties from the point of view of quantum information theo…
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck（因斯布鲁克大学）；Technische Universität Wien（维也纳工业大学）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；neQxt GmbH（neQxt有限公司）；Alpine Quantum Technologies GmbH（阿尔卑斯量子技术有限公司）
Even if a logical network consists of thermodynamically reversible gate operations, the computation process may have high dissipation rate if the gate implementation is controlled by external clock signals. It is an open question whether the global clocking mechanism necessarily envolves irreversible processes. However, one can show that it is not possible to extract any timing information from a micro-physical clock without disturbing it. Applying recent results of quantum information theory we can show a hardware-independent lower bound on the timing information that is necessarily destroyed…
Lifting connectivity bottlenecks in superconducting quantum processors via enriched native two-qubit gates
China Telecom Quantum Information Technology Group Co., Ltd.（中国电信量子信息技术集团有限公司）；Quantum Research Institute of China Telecom（中国电信量子研究院）；Department of Computer Science and Technology, Tsinghua University（清华大学计算机科学与技术系）；TraverseQuantum Co., Ltd.（Tianyu Quantum Co., Ltd.）；Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology（香港科技大学电子与计算机工程系）
Quantum computers require quantum processors. An important part of the processor of any computer is the arithmetic unit, which performs binary addition, subtraction, division and multiplication, however multiplication can be performed using repeated addition, while division can be performed using repeated subtraction. In this paper we present two designs using the reversible $R^3$ gate to perform the quantum half adder/ subtractor and the quantum full adder/subtractor. The proposed half adder/subtractor design can be used to perform different logical operations, such as $AND$, $XOR$, $NAND$, $…
