Maximally entangled states are a key resource in many quantum communication and computation tasks, and their certification is a crucial element to guarantee the desired functionality. We introduce collective strategies for the efficient, local verification of ensembles of Bell pairs that make use of an initial information and noise transfer to few copies prior to their measurement. In this way the number of entangled pairs that need to be measured and hence destroyed is significantly reduced as compared to previous, even optimal, approaches that operate on individual copies. Moreover the remaining states are directly certified. We show that our tools can be extended to other problems and larger classes of multipartite states.
In this paper, we employ theoretical and experimental efforts and realize a proof-of-principle verification of device-independent QKD based on the photonic setup. On the theoretical side, we enhance the loss tolerance for real device imperfections by combining different approaches, namely, random post-selection, noisy preprocessing, and developed numerical methods to estimate the key rate via the von Neumann entropy. On the experimental side, we develop a high-quality polarization-entangled photon source achieving a state-of-the-art (heralded) detection efficiency about 87.5%. This efficiency …
We propose an experiment to realize radiation to atom continuous variable quantum mapping, i.e. to teleport the quantum state of a single mode radiation field onto the collective state of atoms with a given momentum out of a Bose-Einstein condensate. The atoms-radiation entanglement needed for the teleportation protocol is established through the interaction of a single mode with the condensate in presence of a strong far off-resonant pump laser, whereas the coherent atomic displacement is obtained by the same interaction with the radiation in a classical coherent field. In principle, verifica…
In secure quantum communication protocols, a set of single qubits prepared using 2 or more mutually unbiased bases or a set of $n$-qubit ($n\geq2$) entangled states of a particular form are usually used to form a verification string which is subsequently used to detect traces of eavesdropping. The qubits that form a verification string are referred to as decoy qubits, and there exists a large set of different quantum states that can be used as decoy qubits. In the absence of noise, any choice of decoy qubits provides equivalent security. In this paper, we examine such equivalence for noisy env…
Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately, that verification of the output of the quantum systems is not so trivial, since predicting the output is exponentially hard. As another problem, quantum system is very delicate for noise and thus needs error correction. Here we propose a framework for verification of the output of fault-tolerant quantum computation in the measurement-based model. Contrast t…
Quantum processes, such as quantum circuits, quantum memories, and quantum channels, are essential ingredients in almost all quantum information processing tasks. However, the characterization of these processes remains a daunting task due to the exponentially increasing amount of resources required by traditional methods. Here, by first proposing the concept of quantum process verification, we establish two efficient and practical protocols for verifying quantum processes which can provide an exponential improvement over the standard quantum process tomography and a quadratic improvement over…
We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled qubits. We introduce QPV protocols that are practically secure: they only require single-qubit states from each of the verifiers, yet their security is broken if the adversaries share an impractically large number of shared entangled qubits. These protocols are a modification of known QPV protocols in which we include a classical random oracle…
Data Verification is the Future of Quantum Computing Copilots
Imperial College London（帝国理工学院）；Purdue University（普渡大学）；National Chung Hsing University（国立中兴大学）；BCG X AI Science Institute, Boston Consulting Group（波士顿咨询集团 BCG X 人工智能科学研究所）
Quantum computations are expressed in general as quantum circuits, which are specified by ordered lists of quantum gates. The resulting specifications are used during the optimisation and execution of the expressed computations. However, the specification format makes it difficult to verify that optimised or executed computations still conform to the initial gate list specifications: showing the computational equivalence between two quantum circuits expressed by different lists of quantum gates is exponentially complex in the worst case. In order to solve this issue, this work presents a deriv…
To employ a quantum device, the performance of the quantum gates in the device needs to be evaluated first. Since the dimensionality of a quantum gate grows exponentially with the number of qubits, evaluating the performance of a quantum gate is a challenging task. Recently, a scheme called quantum gate verification (QGV) has been proposed, which can verifies quantum gates with near-optimal efficiency. In this paper, we implement a proof-of-principle optical experiment to demonstrate this QGV scheme. We show that for a single-qubit quantum gate, only $\sim300$ samples are needed to confirm the…
Consider the task of verifying that a given quantum device, designed to produce a particular entangled state, does indeed produce that state. One natural approach would be to characterise the output state by quantum state tomography; or alternatively to perform some kind of Bell test, tailored to the state of interest. We show here that neither approach is optimal amongst local verification strategies for two qubit states. We find the optimal strategy in this case and show that quadratically fewer total measurements are needed to verify to within a given fidelity than in published results for …
The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is input to the QFT. Thus, in implementing a good QFT, we may imagine that it needs to perform well on arbitrary input states. Verifying this worst-case correct behaviour of a QFT-implementation would be exponentially hard (in the number of qubits) in general, raising the concern that this verification would be impossible in practice on any useful-sized system. …
The initialization of a quantum system into a certain state is a crucial aspect of quantum information science. While a variety of measurement strategies have been developed to characterize how well the system is initialized, for a given one, there is in general a trade-off between its efficiency and the accessible information of the quantum state. Conventional quantum state tomography can characterize unknown states by reconstructing the density matrix; however, its exponentially expensive postprocessing is likely to produce a deviate result. Alternatively, quantum state verification provides…
We study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework that can be used to prove that QCMA machines, with only classical witnesses, cannot verify certain properties of subsets given implicitly via an oracle. We use this framework to prove an oracle separation between QCMA and QMA using an "in-place" permutation oracle, making the first progress on this question since Aaronson and Kuperberg in 2007. We also use the framework to prove a particularly simple standard oracle …
We consider the optical generation and verification of entanglement in atomic ensembles under non-uniform interaction between the ensemble and an optical mode. We show that for a wide range of parameters a system of non-uniformly coupled atomic spins can be described as an ensemble of uniformly coupled spins with a reduced effective atom-light coupling and a reduced effective atom number, with a reduction factor of order unity given by the ensemble-mode geometry. This description is valid even for complex entangled states with arbitrary phase-space distribution functions as long as the detecti…
Assessing the quality of an ensemble of noisy entangled states is a central task in quantum information processing. Usually this is done by measuring and hence destroying multiple copies, from which state tomography or fidelity estimation can be employed to characterize states. Here we propose several methods to directly distinguish between two different sets of states, e.g. if their fidelity is above or below a certain threshold value. This turns out to be significantly more efficient, and importantly keeps the verified states intact. We make use of auxiliary entanglement or an ensemble of la…
Among various multipartite entangled states, Dicke states stand out because their entanglement is maximally persistent and robust under particle losses. Although much attention has been attracted for their potential applications in quantum information processing and foundational studies, the characterization of Dicke states remains as a challenging task in experiments. Here, we propose efficient and practical protocols for verifying arbitrary $n$-qubit Dicke states in both adaptive and nonadaptive ways. Our protocols require only two distinct settings based on Pauli measurements besides permut…
Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise effects. Hence, they are called noisy-intermediate scale quantum devices. In order to accomplish efficient quantum computation with using these machines, a key issue is going to be the coherent control of individual and collective quantum noises. In this work, we focus on a latter type and investigate formulations of the collective quantum noises represented …
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…
Several quantum process algebras have been proposed and successfully applied in verification of quantum cryptographic protocols. All of the bisimulations proposed so far for quantum processes in these process algebras are state-based, implying that they only compare individual quantum states, but not a combination of them. This paper remedies this problem by introducing a novel notion of distribution-based bisimulation for quantum processes. We further propose an approximate version of this bisimulation that enables us to prove more sophisticated security properties of quantum protocols which …
The computational advantage of noisy quantum computers has been demonstrated by sampling the bitstrings of quantum random circuits. An important issue is how the performance of quantum devices could be quantified in the so-called "supremacy regime". The standard approach is through the linear cross entropy benchmark (XEB), where the theoretical value of the probability is required for each bitstring. However, the computational cost of XEB grows exponentially. So far, random circuits of the 53-qubit Sycamore chip were verified up to 10 cycles of gates only; the XEB fidelities of deeper circuits…
Many experiments in quantum information aim at creating multi-partite entangled states. Quantifying the amount of entanglement that was actually generated can, in principle, be accomplished using full-state tomography. This method requires the determination of a parameter set that is growing exponentially with the number of qubits and becomes infeasible even for moderate numbers of particles. Non-trivial bounds on experimentally prepared entanglement can however be obtained from partial information on the density matrix. The fundamental question that needs to be addressed in this context is th…
So-called direct measurements of entanglement are collective measurements on multiple copies of a (bipartite or multipartite) quantum system that directly provide one a value for some entanglement measure, such as the concurrence for bipartite states. Multiple copies are needed since the entanglement of a mixed state is not a linear function of the density matrix. Unfortunately, so far all experimental implementations of direct measurements made unverified assumptions about the form of the states, and, therefore, do not qualify as entanglement verification tests. I discuss how a direct measure…
Loss of inputs can be detrimental to the security of quantum position verification (QPV) protocols, as it may allow attackers to not answer on all played rounds, but only on those they perform well on. In this work, we study \textit{loss-tolerant} QPV protocols. We propose a new fully loss-tolerant protocol QPV$_{\textsf{SWAP}}$, based on the SWAP test, with several desirable properties. The task of the protocol, which could be implemented using only a single beam splitter and two detectors, is to estimate the overlap between two input states. By formulating possible attacks as a semi-definite…
We consider work extraction from $N$ copies of a quantum system. When the same work-extraction process is implemented on each copy, the relative size of fluctuations is expected to decay as $1/\sqrt{N}$. Here, we consider protocols where the copies can be processed collectively, and show that in this case work fluctuations can disappear exponentially fast in $N$. As a consequence, a considerable proportion of the average extractable work $\mathcal{W}$ can be obtained almost deterministically by globally processing a few copies of the state. This is derived in the two canonical scenarios for wo…
Current proposals focusing on neutral atoms for quantum computing are mostly based on using single atoms as quantum bits (qubits), while using cavity induced coupling or dipole-dipole interaction for two-qubit operations. An alternative approach is to use atomic ensembles as qubits. However, when an atomic ensemble is excited, by a laser beam matched to a two-level transition (or a Raman transition) for example, it leads to a cascade of many states as more and more photons are absorbed^1. In order to make use of an ensemble as a qubit, it is necessary to disrupt this cascade, and restrict the …
Spin collective phenomena including superradiance are even today being intensively investigated with experimental tests performed based on state-of-the-art quantum technologies. Such attempts are not only for the simple experimental verification of predictions from the last century but also as a motivation to explore new applications of spin collective phenomena and the coherent control of the coupling between spin ensembles and reservoirs. In this paper, we investigate the open quantum dynamics of two spin ensembles (double spin domains) coupled to a common bosonic reservoir. We analyze in de…
We introduce tqix.pis, a library of tqix, for quantum dynamics simulation of spin ensembles. The library emulates a dynamic process by a quantum circuit, including initializing a quantum state, executing quantum operators, and measuring the final state. It utilizes collective processes in spin ensembles to reduce the dimension from exponentially to quadratically with the number of particles, i.e., the quantum state spans in Dicke basis. It also facilitates the simulation time with multi-core processors and Graphics Processing Units. The library is thus applicable for the simulation of ensemble…
Quantum subspace verification for error correction codes
Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University（清华大学交叉信息研究院量子信息中心）；Pritzker School of Molecular Engineering, The University of Chicago（芝加哥大学普里茨克分子工程学院）；Department of Computer Science, University of Hong Kong（香港大学计算机科学系）；Key Laboratory for Information Science of Electromagnetic Waves (Ministry of Education), Fudan University（复旦大学电磁波信息科学教育部重点实验室）
We propose a practical quantum cryptographic scheme which combines high information capacity, such as provided by high-dimensional quantum entanglement, with the simplicity of a two-dimensional Clauser-Horne-Shimony-Holt (CHSH) Bell test for security verification. By applying a state combining entanglement in a two-dimensional degree of freedom, such as photon polarization, with high-dimensional correlations in another degree of freedom, such as photon orbital angular momentum (OAM) or path, the scheme provides a considerably simplified route towards security verification in quantum key distri…
Dicke states are typical examples of quantum states with genuine multipartite entanglement. They are valuable resources in many quantum information processing tasks, including multiparty quantum communication and quantum metrology. Phased Dicke states are a generalization of Dicke states and include antisymmetric basis states as a special example. These states are useful in atomic and molecular physics besides quantum information processing. Here we propose practical and efficient protocols based on adaptive local projective measurements for verifying all phased Dicke states, including $W$ sta…
Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a protocol that lifts classical SMPC to quantum SMPC in a composably and statistically secure way, even for a single honest party. Unlike previous quantum SMPC protocols, our proposal only requires very limited quantum resources from all but one party; it suffices that the weak parties, i.e. the clients, are able to prepare single-qubit states in the X-Y plane. The novel quantum SMPC protocol is constructed in a naturally…
This paper discusses the use of computer-aided verification as a practical means for analysing quantum information systems; specifically, the BB84 protocol for quantum key distribution is examined using this method. This protocol has been shown to be unconditionally secure against all attacks in an information-theoretic setting, but the relevant security proof requires a thorough understanding of the formalism of quantum mechanics and is not easily adaptable to practical scenarios. Our approach is based on probabilistic model-checking; we have used the PRISM model-checker to show that, as the …
Correlated excitations in a plane circular configuration of identical atoms with parallel dipole moments are investigated. The collective energy eigenstates, their level shifts and decay rates are computed utilizing a decomposition of the atomic state space into carrier spaces for the irreducible representations of the symmetry group $\ZZ_N$ of the circle. It is shown that the index $p$ of these representations can be used as a quantum number analogously to the orbital angular momentum quantum number $l$ in hydrogen-like systems. Just as the hydrogen s-states are the only electronic wave funct…
If a system of flavor-oscillating neutrinos is at high enough densities that neutrino-neutrino coherent forward scatterings are non-negligible, the system becomes a time-dependent many-body problem. An important and open question is whether the flavor evolution is sufficiently described by a mean-field approach or can be strongly affected by correlations arising from two-body interactions in the neutrino Hamiltonian, as measured by nontrivial quantum entanglement. Numerical computations of the time evolution of many-body quantum systems are challenging because the size of the Hilbert space sca…
