We draw an explicit connection between the statistical properties of an entangled two-mode continuous variable (CV) resource and the amount of entanglement that can be dynamically transferred to a pair of non-interacting two-level systems. More specifically, we rigorously reformulate entanglement transfer process by making use of covariance matrix formalism. When the resource state is Gaussian, our method makes the approach to the transfer of quantum correlations much more flexible than in previously considered schemes and allows the straightforward inclusion of the effects of noise affecting the CV system. Moreover, the proposed method reveals that the use of de-Gaussified two-mode states is almost never advantageous for transferring entanglement with respect to the full Gaussian picture, despite the entanglement in the non-Gaussian resource can be much larger than in its Gaussian counterpart. We can thus conclude that the entanglement-transfer map overthrows the "ordering" relations valid at the level of CV resource states.
We propose a post-processing method for message-passing (MP) decoding of CSS quantum LDPC codes, called stabilizer-inactivation (SI). It relies on inactivating a set of qubits, supporting a check in the dual code, and then running the MP decoding again. This allows MP decoding to converge outside the inactivated set of qubits, while the error on these is determined by solving a small, constant size, linear system. Compared to the state of the art post-processing method based on ordered statistics decoding (OSD), we show through numerical simulations that MP-SI outperforms MP-OSD for different …
The communication cost of a classical protocol is typically measured in terms of the number of bits communicated for this determines the time required for communication during the protocol. Similarly, for quantum communication protocols, which use finite-dimensional quantum states, the communication cost is measured in terms of the number of qubits communicated. However, in quantum physics, one can also use infinite-dimensional states, like optical quantum states, for communication protocols. Communication cost measures based on counting the (equivalent) number of qubits transmitted during com…
Necessary and sufficient criterion for k-separability of N-qubit noisy GHZ states
一个多体纠缠态有许多种不同的纠缠，这些纠缠由粒子的数目决定。多体纠缠最基本的例子是白噪声中多量子比特Greenberger-Horne-Zeilinger（GHZ）态的纠缠。我们明确地构造了这些状态的纠缠证人与GHZ态的稳定剂生成器。对于白噪声中的$N$量子比特GHZ态，我们证明了当任意$N$和$k$被分成$k$和$N\leq 2k-1$时，它是可分离的充要条件.该判据涵盖了白噪声中$% N $ -量子比特GHZ态的一半以上的部分纠缠。对于其余的多体纠缠问题，我们给出了一种方法来获得分离性的充分条件。作为应用，我们考虑了$N$量子比特GHZ态作为简并量子码通过去极化信道的码字。我们发现当量子信道容量从正减小到零时，输出态既不是真正纠缠的，也不是完全可分的。
The long-time maintenance of quantum coherence is crucial for its practical applications. We explore decoherence process of a multiqubit system passing through a correlated channel (phase flip, bit flip, bit-phase flip, and depolarizing). The results show that the decay of coherence was evidently delayed when the consecutive actions of the channel on the sequence of qubits has some classical correlations. In particular, the relative entropy of coherence for a system with large number of qubits is more robust than that with small number of qubits. We also provide an explanation for the delayed …
Drive-Through Quantum Gate: Non-Stop Entangling a Mobile Ion Qubit with a Stationary One
National Taiwan University（国立台湾大学）；National Center for Theoretical Sciences（国家理论科学中心）；National University of Singapore（新加坡国立大学）；Institute of Atomic and Molecular Sciences, Academia Sinica（中央研究院原子与分子科学研究所）；Trapped-Ion Quantum Computing Laboratory, Hon Hai Research Institute, Foxconn（鸿海研究院会离子阱量子计算实验室）
Quantum operations, or quantum channels cannot be inverted in general. An arbitrary state passing through a quantum channel looses its fidelity with the input. Given a quantum channel ${\cal E}$, we introduce the concept of its quasi-inverse as a map ${\cal E}^{qi}$ which when composed with ${\cal E}$ increases its average input-output fidelity in an optimal way. The channel ${\cal E}^{qi}$ comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.
High-fidelity multiqubit gates with Rydberg atoms via level-crossing-free Rapid adiabatic passage
College of Physics and Electronic Engineering, Shanxi University（山西大学物理电子工程学院）；Collaborative Innovation Center of Extreme Optics, Shanxi University（山西大学极端光学协同创新中心）
In this manuscript, the behavior of the Wigner function of accelerated and non-accelerated two qubit system passing through different noisy channels is discussed. The decoherence of the initial quantum correlation due to the noisy channels and the acceleration process is investigated by means of Wigner function. The negative (positive) behavior of the Wigner function predicts the gain of the quantum (classical) correlations. Based on the upper and lower bounds of the Wigner function, the entangled initial state loses its quantum correlation due the acceleration process and the strengths of the…
Practical implementations of quantum key distribution (QKD) have been shown to be subject to various detector side-channel attacks that compromise the promised unconditional security. Most notable is a general class of attacks adopting the use of faked-state photons as in the detector-control and, more broadly, the intercept-resend attacks. In this paper, we present a simple scheme to overcome such class of attacks: A legitimate user, Bob, uses a polarization randomizer at his gateway to distort an ancillary polarization of a phase-encoded photon in a bidirectional QKD configuration. Passing t…
The quantum volume test is a full-system benchmark for quantum computers that is sensitive to qubit number, fidelity, connectivity, and other quantities believed to be important in building useful devices. The test was designed to produce a single-number measure of a quantum computer's general capability, but a complete understanding of its limitations and operational meaning is still missing. We explore the quantum volume test to better understand its design aspects, sensitivity to errors, passing criteria, and what passing implies about a quantum computer. We elucidate some transient behavio…
Superposition states of circular currents of exciton-polaritons mimic the superconducting flux qubits. The phase of a polariton fluid must change by an integer number of $2π$, when going around the ring. If one introduces a $π$-phase delay line in the ring, the fluid is obliged to propagate a clockwise or anticlockwise circular current to reduce the total phase gained over one round-trip to zero or to build it up to $2π$. We show that such a $π$-delay line can be provided by a dark soliton pinned to a potential well created by a C-shape non-resonant pump-spot. The resulting split-ring polarito…
We investigate the witnessing of two-qubit entangled states by sequential and independent pairs of observers, with both observers of each pair acting independently on their part of the shared state from spatially separated laboratories, and subsequently passing their qubits to the next pair in the sequence. It has previously been conjectured that not more than one pair of observers can detect Clauser-Horne-Shimony-Holt "Bell-nonlocal" correlations in a similar set-up. This is intriguing since it is possible to have an arbitrarily long sequence of Bell-nonlocal correlations when only a single o…
Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy
LIP6, CNRS, Sorbonne Université, Paris, France（巴黎大学LIP6研究所、法国国家科学研究中心、索邦大学）；QC Ware, Palo Alto, USA and Paris, France（QC Ware公司，美国帕洛阿尔托及法国巴黎）；School of Informatics, University of Edinburgh, Edinburgh, UK（爱丁堡大学信息学院，英国爱丁堡）；Fujitsu Research of Europe Ltd., United Kingdom（日本富士通欧洲研究有限公司，英国）；Terra Quantum GmbH, Germany（德国Terra Quantum GmbH公司）；Quantum Research Center, Technology Innovation Institute, Abu Dhabi, UAE（阿布扎赫尔技术创新研究所量子研究中心，阿联酋）
This is the second paper in a series of two. Using a multi-particle continuous-time quantum walk with two internal states, which has been formulated in the first paper (arXiv:2112.08119), we physically implement a quantum random access memory (qRAM). Data with address information are dual-rail encoded into quantum walkers. The walkers pass through perfect binary trees to access the designated memory cells and copy the data stored in the cells. A roundabout gate allocated at each node serves as a router to move the walker from the parent node to one of two child nodes, depending on the internal…
The maximal evolution speed of a quantum system can be represented by quantum speed limit time (QSLT).We investigate QSLT of a two-qubit system passing through a correlated channel (amplitude damping, phase damping, and depolarizing).By adjusting the correlation parameter of channel and the initial entanglement,a method to accelerate the evolution speed of the system for some specific channels is proposed.It is shown that, in amplitude damping channel and depolarizing channel,QSLT may be shortened in some cases by increasing correlation parameter of the channel and initial entanglement, which …
Practical applications of quantum computers require millions of physical qubits and it will be challenging for individual quantum processors to reach such qubit numbers. It is therefore timely to investigate the resource requirements of quantum algorithms in a distributed setting, where multiple quantum processors are interconnected by a coherent network. We introduce an extension of the Message Passing Interface (MPI) to enable high-performance implementations of distributed quantum algorithms. In turn, these implementations can be used for testing, debugging, and resource estimation. In addi…
We consider several models of 1-round classical and quantum communication, some of these models have not been defined before. We "almost separate" the models of simultaneous quantum message passing with shared entanglement and the model of simultaneous quantum message passing with shared randomness. We define a relation which can be efficiently exactly solved in the first model but cannot be solved efficiently, either exactly or in 0-error setup in the second model. In fact, our relation is exactly solvable even in a more restricted model of simultaneous classical message passing with shared e…
