We consider the change of entanglement of formation $ΔE$ produced by the Hadamard-CNOT circuit on a general (pure or mixed) state $ρ$ describing a system of two qubits. We study numerically the probabilities of obtaining different values of $ΔE$, assuming that the initial state is randomly distributed in the space of all states according to the product measure recently introduced by Zyczkowski {\it et al.} [Phys. Rev. A {\bf 58} (1998) 883].
Controlled-NOT (CNOT) gates are commonly included in the standard gate set of quantum processors and provide an important way to entangle qubits. For fixed-frequency qubits using the cross-resonance entangling technique, using the higher-frequency qubit to control the lower-frequency qubit enables much shorter entangling times than using the lower-frequency qubit as the control. Consequently, when implementing a CNOT gate where logical control by the lower-frequency qubit is needed, compilers may implement this functionality by using an equivalent circuit such as placing Hadamard gates on both…
It is shown that the two qubit CNOT (controlled NOT) gate can also be realised using q-deformed angular momentum states via the Jordan-Schwinger mechanism.Thus all the three gates necessary for universality i.e. Hadamard, Phase Shift and the two qubit CNOT gate are realisable with q-deformed oscillators.
We propose a deterministic and scalable scheme to construct a two-qubit controlled-NOT (CNOT) gate and realize entanglement swapping between photonic qubits using a quantum-dot (QD) spin in a double-sided optical microcavity. The scheme is based on spin selective photon reflection from the cavity and can be achieved in a nondestructive and heralded way. We assess the feasibility of the scheme and show that the scheme can work in both the weak coupling and the strong coupling regimes. The scheme opens promising perspectives for long-distance photonic quantum communication and distributed quantu…
We present a way for entanglement purification based on two parametric down-conversion (PDC) sources with cross-Kerr nonlinearities. It is comprised of two processes. The first one is a primary entanglement purification protocol for PDC sources with nondestructive quantum nondemolition (QND) detectors by transferring the spatial entanglement of photon pairs to their polarization. In this time, the QND detectors act as the role of controlled-not (CNot) gates. Also they can distinguish the photon number of the spatial modes, which provides a good way for the next process to purify the entangleme…
While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qubits is one such constraint that restricts two-qubit operations, such as CNOT, to "connected" qubits. SWAP gates can be used to place the logical qubits on admissible physical qubits, but they entail a significant increase in CNOT-count. In this paper we consider the problem of reducing the CNOT-count in Clifford+T circuits on connectivity constrained architectures, like noisy intermediate-scale quantum (NISQ) computi…
The distribution of entangled states between distant locations will be essential for the future large scale realization of quantum communication schemes such as quantum cryptography and quantum teleportation. Because of the unavoidable noise in the quantum communication channel, the entanglement between two particles is more and more degraded the further they propagate. Entanglement purification is thus essential to distill highly entangled states from less entangled ones. Existing general purification protocols are based on the quantum controlled-NOT (CNOT) or similar quantum logic operations…
A two-party quantum private comparison scheme using GHZ states and error-correcting code (ECC) was introduced in Li et al.'s paper [Int. J. Theor. Phys. 52: 2818-2815, 2013], which holds the capability of fault-tolerate and could be performed in a none-ideal scenario. However, this study points out there exists a fatal loophole under a special attack, namely the twice-Hadamard-CNOT attack. A malicious party may intercept the other's particles, firstly executes the Hadamard operations on these intercepted particles and his (her) own ones respectively, and then sequentially performs twice CNOT o…
Compressibility of genuine multipartite entanglement under the Hadamard map
Faculty of Mathematics and Physics, Charles University（查理大学数学与物理学院）；Technische Universität Wien（维也纳工业大学）；Naturwissenschaftlich-Technische Fakultät, Universität Siegen（锡根大学自然科学技术学院）
The basic one-bit gates (X, Y, Z, Hadamard, phase, pi/8) as well as the controlled cnot and Toffoli gates are reformulated in the language of geometric-algebra quantum-like computation. Thus, all the quantum algorithms can be reformulated in purely geometric terms without any need of tensor products.
We consider how the Hamiltonian Quantum Computing scheme introduced in [arXiv:1509.01278] can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive cross-Kerr and weak flip-flop or hopping interactions and we detail how this can be achieved. Our proposal uses a new electric circuit for obtaining the attractive cross-Kerr coupling between transmons via a dipole-like element. We discuss and numerically analyze the forward motion and execution of the computation and its dependence on coupling strengths and their va…
We present experimental results on two-qubit Rydberg blockade quantum gates and entanglement in a two-dimensional qubit array. Without post selection against atom loss we achieve a Bell state fidelity of $0.73\pm 0.05$, the highest value reported to date. The experiments are performed in an array of single Cs atom qubits with a site to site spacing of $3.8 ~ μ\rm m$. Using the standard protocol for a Rydberg blockade C$_Z$ gate together with single qubit operations we create Bell states and measure their fidelity using parity oscillations. We analyze the role of AC Stark shifts that occur when…
We propose a Lyapunov control design to achieve specific (or a family of) unitary time-evolution operators, i.e., quantum gates in the Schrödinger picture by tracking control. Two examples are presented. In the first, we illustrate how to realize the Hadamard gate in a single-qubit system, while in the second, the controlled-NOT (CNOT) gate is implemented in two-qubit systems with the Ising and Heisenberg interactions. Furthermore, we demonstrate that the control can drive the time-evolution operator into the local equivalence class of the CNOT gate and the operator keeps in this class forever…
Efficient quantum phase estimation with adaptive entanglement-assisted Hadamard test
School of Mathematical Sciences, Fudan University（复旦大学数学科学学院）；QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong（香港大学计算与数据科学学院量子信息与计算倡议中心）；Shanghai Key Laboratory for Contemporary Applied Mathematics（当代应用数学上海市重点实验室）
We show how to construct a multi-qubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other N-1 qubits. We provide an algorithm how to build up an array of networks consisting of single-qubit rotations and multi-qubit control-NOT gates for the synthesis of an arbitrary entangled quantum state of N qubits. We illustrate the algorithm on a system of cold trapped ions. This example illuminates the efficiency of the direct implementation of the multi-qubit CNOT gate compared to its decomposition…
We present a class of maximally entangled states generated by a high-dimensional generalisation of the \textsc{cnot} gate. The advantage of our approach is the simple algebraic structure of both entangling operator and resulting entangled states. In order to show that the method can be applied to any dimension, we introduce new sufficient conditions for global and maximal entanglement with respect to Meyer and Wallach's measure.
Quantum gates, that play a fundamental role in quantum computation and other quantum information processes, are unitary evolution operators $\hat U$ that act on a composite system changing its entanglement. In the present contribution we study some aspects of these entanglement changes. By recourse of a Monte Carlo procedure, we compute the so called "entangling power" for several paradigmatic quantum gates and discuss results concerning the action of the CNOT gate. We pay special attention to the distribution of entanglement among the several parties involved.
In the framework of cavity QED, we propose a practical scheme to purify dynamically a bipartite entangled state using short chains of atoms coupled to high-finesse optical cavities. In contrast to conventional entanglement purification protocols, we avoid CNOT gates, thus reducing complicated pulse sequences and superfluous qubit operations. Our interaction scheme works in a deterministic way, and together with entanglement distribution and swapping, opens a route towards efficient quantum repeaters for long-distance quantum communication.
Quantum entanglement is a critical resource for quantum information and quantum computation. However, entanglement of a quantum system is subjected to change due to the interaction with the environment. One typical result of the interaction is the amplitude damping that usually results in the reduction of the entanglement. Here we propose a protocol to protect quantum entanglement from the amplitude damping by applying Hadamard and CNOT gates. As opposed to some recently studied methods, the scheme presented here does not require weak measurement in the reversal process, leading to a faster re…
We present an efficient way for measuring the entanglement of the atoms. Through the auxiliary single photons input-output process in cavity quantum electrodynamics (QED), the concurrence of the atomic entanglement can be obtained according to the success probability of picking up the singlet states of the atoms. This protocol has three advantages: First, we do not require the sophisticated controlled-not (CNOT) gates. Second, the distributed atoms are not required to intact with each other. Third, the atomic entanglement can be distributed nonlocally, which provides its important applications…
We present the first demonstration of a CNOT gate using neutral atoms. Our implementation of the CNOT uses Rydberg blockade interactions between neutral atoms held in optical traps separated by >8 μ\rm m. We measure CNOT fidelities of F=0.73 and 0.72 using two different gate protocols, and show by measurement of parity oscillations that the gate can be used to generate two-atom states with fidelity at the threshold for entanglement. We anticipate that the long range nature of the Rydberg interaction will be attractive for future extensions of this work to multi-qubit systems.
We consider the realization of quantum Fredkin gate with only linear optics and single photons. First we construct a heralded Fredkin gate using four heralded controlled-not (CNOT) gates. Then we simplify this method to a post-selected one utilizing only two CNOT gates. We also give a possible realization of this method which is feasible with current experimental technology. Another post-selected scheme requires time entanglement of the input photons but needs no ancillary photons.
We describe quantum circuits generating four-qubit maximally entangled states, the amount of entanglement being quantified by using the absolute value of the Cayley hyperdeterminant as an entanglement monotone. More precisely, we show that this type of four-qubit entangled states can be obtained by the action of a family of CNOT circuits on some special states of the LU orbit of the state |0000 >.
We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of approximately 45%, thereby improving on a previous bound of 50% (due to Razborov). Our precise quantum circuit model enables perfect gates from the Clifford group (CNOT, Hadamard, S, X, Y, Z) and arbitrary additional one-qubit gates that are subject to that much depolarizing noise. We prove that this set of gates cannot be universal for arbitrary (even classical) computation, from which the upper bound on the noise threshold for fault-tolerant quantum computation follows.
Recently, several similar protocols[J. Opt. B 4 (2002) 380; Phys. Lett. A 316 (2003) 159; Phys. Lett. A 355 (2006) 285; Phys. Lett. A 336 (2005) 317] for remotely preparing a class of multi-qubit states (i.e, $α|0 ... 0>+β|1... 1>$) are proposed, respectively. In this paper, by applying the controlled-not (CNOT) gate, a new simple protocol is proposed for remotely preparing such class of states. Compared to the previous protocols, both classical communication cost and required quantum entanglement in our protocol are remarkably reduced. Moreover, the difficulty of identifying some quantum stat…
Teleportation of quantum gates is a critical step for implementation of quantum networking and teleportation-based models of quantum computation. We report an experimental demonstration of teleportation of the prototypical quantum controlled-NOT (CNOT) gate. Assisted with linear optical manipulations, photon entanglement produced from parametric down conversion, and coincidence measurements, we teleport the quantum CNOT gate from acting on local qubits to acting on remote qubits. The quality of the quantum gate teleportation is characterized through the method of quantum process tomography, wi…
In our earlier work we posited that simple quantum gates and quantum algorithms can be designed utilizing the diffraction phenomena of a photon within a multiplexed holographic element. The quantum eigenstates we use are the photon's transverse linear momentum (LM) as measured by the number of waves of tilt across the aperture. Two properties of linear optical quantum computing (LOQC) within the circuit model make this approach attractive. First, any conditional measurement can be commuted in time with any unitary quantum gate; and second, photon entanglement can be encoded as a superposition …
The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor-2 increase in the number of bits needed to represent a state. We have implemented the improved algorithm in a freely-available program called CHP (CNOT-Hadamard-Phase), which can handle thousands of qubits easily. Second, …
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle operations are restricted, then the same statement can be true for generalised non-quantum notions of entanglement. Here we show that this can improve the applicability of limited-entanglement simulation algorithms. In particular, we show that by using a non-quantum notion of separability a classical simulation algorithm of Harrow & Nielsen can efficiently simulate …
We find out a few ways to improve the realization of entanglement between the internal (spin) and external (position) degrees of freedom of a quantum particle, through the insertion of disordered time steps along a one-dimensional discrete time quantum walk. The disorder is introduced by a randomly chosen quantum coin obtained from a uniform distribution among infinite quantum coins or only between Hadamard and Fourier coins for all the time steps. We can also decrease the amount of disorder by alternating disordered and ordered time steps along a quantum walk or by establishing a probability …
A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical capacity of the channel. Along with a corresponding achievability statement for rates below the capacity, such a strong converse theorem enhances our understanding of the capacity as a very sharp dividing line between achievable and unachievable rates of communication. Here, we show that such a strong converse theorem holds for the …
We introduce a volumetric benchmark for near-term quantum platforms based on the generation and verification of genuine entanglement across n-qubits using graph states and direct stabilizer measurements. Our benchmark evaluates the robustness of multipartite and bipartite n-qubit entanglement with respect to many sources of hardware noise: qubit decoherence, CNOT and swap gate noise, and readout error. We demonstrate our benchmark on multiple superconducting qubit platforms available from IBM (ibmq_belem, ibmq_toronto, ibmq_guadalupe and ibmq_jakarta). Subsets of $n<10$ qubits are used for gra…
This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph $G$ is $c$-colourable where $c$ is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of …
We investigate capacitively coupled two-qubit quantum gates based on quantum dots. For exchange-only coded qubits electron spin $S$ and its projection $S_z$ are exact quantum numbers. Capacitive coupling between qubits, as distinct from interqubit exchange, preserves these quantum numbers. We prove, both analytically and numerically, that conservation of the spins of individual qubits has dramatic effect on performance of two-qubit gates. By varying the level splittings of individual qubits, $J_a$ and $J_b$, and the interqubit coupling time $t$, we can find an infinite number of triples $(J_a,…
We test the principle of majorization [J. I. Latorre and M. A. Martin-Delgado, Phys. Rev. A 66, 022305 (2002)] in random circuits. Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. The studied families are: {CNOT, H, T}, {CNOT, H, NOT}, {CNOT, H, S} (Clifford), matchgates, and IQP (instantaneous quantum polynomial-time). We verified that all the families of circuits satisfy on average the principle of decreasing majorization. In most cases the asymptotic state (number of gates going to infinity) beha…
We explicitly show a protocol in which an arbitrary two qubit a|00> + b|01> + c|10> + d|11> is faithfully and deterministically teleported from Alice to Bob. We construct the 16 orthogonal generalized Bell states which can be used to teleport the two qubits. The local operations Bob must perform on his qubits in order to recover the teleported state is also constructed. They are restricted only to single qubit gates. This means that a CNOT gate is not necessary to complete the protocol. A generalization where N qubits is teleported is also shown. We define a generalized magic basis, which poss…
We have presented a theoretical extended version of dense coding protocol using entangled position state of two particles shared between two parties. A representation of Bell states and the required unitary operators are shown utilizing symmetric normalized Hadamard matrices. In addition, some explicit and conceivable forms for the unitary operators are presented by using some introduced basic operators. It is shown that, the proposed version is logarithmically efficient than some other multi-qubit dense coding protocols.
Quantum entanglement and coherence are two fundamental features of nature, arising from the superposition principle of quantum mechanics. While considered as puzzling phenomena in the early days of quantum theory, it is only very recently that entanglement and coherence have been recognized as resources for the emerging quantum technologies, including quantum metrology, quantum communication, and quantum computing. In this work we study the limitations for the interconversion between coherence and entanglement. We prove a fundamental no-go theorem, stating that a general resource theory of sup…
Quantum information science addresses how uniquely quantum mechanical phenomena such as superposition and entanglement can enhance communication, information processing and precision measurement. Photons are appealing for their low noise, light-speed transmission and ease of manipulation using conventional optical components. However, the lack of highly efficient optical Kerr nonlinearities at single photon level was a major obstacle. In a breakthrough, Knill, Laflamme and Milburn (KLM) showed that such an efficient nonlinearity can be achieved using only linear optical elements, auxiliary pho…
Quantum teleportation circumvents the uncertainty principle using dual channels: a quantum one consisting of previously-shared entanglement, and a classical one, together allowing the disembodied transport of an unknown quantum state over distance. It has recently been shown that a classical bit can be counterfactually communicated between two parties in empty space, "Alice" and "Bob". Here, by using our "dual" version of the chained quantum Zeno effect to achieve a counterfactual CNOT gate, we propose the first protocol for transporting an unknown qubit counterfactually, that is without any p…
The real stabilizer fragment of quantum mechanics was shown to have a complete axiomatization in terms of the angle-free fragment of the ZX-calculus. This fragment of the ZX-calculus---although abstractly elegant---is stated in terms of identities, such as spider fusion which generally do not have interpretations as circuit transformations. We complete the category CNOT generated by the controlled not gate and the computational ancillary bits, presented by circuit relations, to the real stabilizer fragment of quantum mechanics. This is performed first, by adding the Hadamard gate and the scala…
We illustrate the entanglement mechanism of quantum space-time itself. We consider a discrete, quantum version of de Sitter Universe with a Planck time-foliation, to which is applied the quantum version of the holographic principle (a Planckian pixel encodes one qubit rather than a bit). This results in a quantum network, where the time steps label the nodes. The quantum fluctuations of the vacuum are the connecting links of the quantum network, while the total number of pixels (qubits) of a spatial slice are the outgoing links from a node n. At each node n there is a couple of quantum gates, …
We study the entanglement between the internal (spin) and external (position) degrees of freedom of the one-dimensional discrete time quantum walk starting from local and delocalized initial states whose time evolution is driven by Hadamard and Fourier coins. We obtain the dependence of the asymptotic entanglement with the initial dispersion of the state and establish a way to connect the asymptotic entanglement between local and delocalized states. We find out that the delocalization of the state increases the number of initial spin states which achieves maximal entanglement from two states (…
We study analytically and numerically the problem of two qubits with fixed coupling irradiated with quantum or classical fields. In the classical case, we derive an effective Hamiltonian, and construct composite pulse sequences leading to a CNOT gate. In the quantum case, we show that qubit-qubit-photon multiparticle entanglement and maximally entangled two-qubit state can be obtained by driving the system at very low powers (one quanta of excitation). Our results can be applied to a variety of systems of two superconducting qubits coupled to resonators.
The discrete-time quantum walk dynamics can be generated by a time-dependent Hamiltonian, repeatedly switching between the coin and the shift generators. We change the model and consider the case where the Hamiltonian is time-independent, including both the coin and the shift terms in all times. The eigenvalues and the related Bloch vectors for the time-independent Hamiltonian are then compared with the corresponding quantities for the effective Hamiltonian generating the quantum walk dynamics. Restricted to the non-localized initial quantum walk states, we optimize the parameters in the time-…
