Random access memory is an indispensable device for classical information technology. Analog to this, for quantum information technology, it is desirable to have a random access quantum memory with many memory cells and programmable access to each cell. We report an experiment that realizes a random access quantum memory of 105 qubits carried by 210 memory cells in a macroscopic atomic ensemble. We demonstrate storage of optical qubits into these memory cells and their read-out at programmable times by arbitrary orders with fidelities exceeding any classical bound. Experimental realization of a random access quantum memory with many memory cells and programmable control of its write-in and read-out makes an important step for its application in quantum communication, networking, and computation.
We demonstrate the implementation of quantum cheque, proposed by Roy Moulick and Panigrahi [Quantum Inf. Process (2016) 15: 2475], using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates have been implemented for the realization of the quantum cheque transaction in a quantum networked banking system. Quantum state tomography reveals the accuracy of the implementation with comparable results from the theoretical and experimental density matrices.
We propose and demonstrate the scaling up of photonic graph state through path qubit fusion. Two path qubits from separate two-photon four-qubit states are fused to generate a two-dimensional seven-qubit graph state composed of polarization and path qubits. Genuine seven-qubit entanglement is verified by evaluating the witness operator. Six qubits from the graph state are used to execute the general two-qubit Deutsch-Jozsa algorithm with a success probability greater than 90%.
In this paper, we propose a scheme to realize three-qubit controlled phase gate and multiqubit controlled-NOT gate of one qubit simultaneously controlling n target qubit with four level quantum system in a cavity. Adjustment of level spacing during the gates implementation is not required. Implementation time for multiqubit controlled NOT gate is independent of number of qubit. Three-qubit phase gate is generalized to n-qubit phase gate with multiple control qubit and the number of steps (complexity) reduces linearly as compare to conventional gate decomposition method. Our scheme can be appli…
Universal single-qubit operations based on purely geometric phase factors in adiabatic processes are demonstrated by utilizing a four-level system in a trapped single $^{40}$Ca$^+$ ion connected by three oscillating fields. Robustness against parameter variations is studied. The scheme demonstrated here can be employed as a building block for large-scale holonomic quantum computations, which may be useful for large qubit systems with statistical variations in system parameters.
We investigate the feasibility of single-shot Toffoli- and Fredkin-gate realizations in qubit arrays with Heisenberg-type exchange interactions between adjacent qubits. As follows from the Lie-algebraic criteria of controllability, such an array is rendered completely controllable -- equivalent to allowing universal quantum computation -- by a Zeeman-like control field with two orthogonal components acting on a single "actuator" qubit. Adopting this local-control setting, we start our analysis with piecewise-constant control fields and determine the global maxima of the relevant figure of meri…
We describe the first experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a 2-bit boolean function in the framework of one-way quantum computation. For this purpose a novel two-photon six-qubit cluster state was engineered. Its peculiar topological structure is the basis of the original measurement pattern allowing the algorithm realization. The good agreement of the experimental results with the theoretical predictions, obtained at $\sim$1kHz success rate, demonstrate the correct implementation of the algorithm.
We perform generalized measurements of a qubit by realizing the qubit as a coin in a photonic quantum walk and subjecting the walker to projective measurements. Our experimental technique can be used to realize photonically any rank-1 single-qubit positive operator-valued measure via constructing an appropriate interferometric quantum-walk network and then projectively measuring the walker's position at the final step.
Here we demonstrate quantum teleportation through hypergraph states, which are the generalization of graph states, and due to their non-local entanglement properties, it allows us to perform quantum teleportation. Here we design some hypergraph states useful for quantum teleportation and process the schemes for quantum teleportation of single-qubit and two-qubit arbitrary states via three-uniform three-qubit and four-qubit hypergraph states respectively. We explicate the experimental realization of quantum teleportation of both single and two-qubit arbitrary states. Then we run our quantum cir…
We present a scheme to achieve maximally entangled states, controlled phase-shift gate, and SWAP gate for two superconducting-quantum-interference-device (SQUID) qubits, by placing SQUIDs in a microwave cavity. We also show how to transfer quantum information from one SQUID qubit to another. In this scheme, no transfer of quantum information between the SQUIDs and the cavity is required, the cavity field is only virtually excited and thus the requirement on the quality factor of the cavity is greatly relaxed.
Any residual coupling of a quantum computer to the environment results in computational errors. Encoding quantum information in a so-called decoherence-free subspace provides means to avoid these errors. Despite tremendous progress in employing this technique to extend memory storage times by orders of magnitude, computation within such subspaces has been scarce. Here, we demonstrate the realization of a universal set of quantum gates acting on decoherence-free ion qubits. We combine these gates to realize the first controlled-NOT gate within a decoherence-free, scalable quantum computer.
We show that with the assistance of a third level of the qubits an n-qubit phase gate can be constructed from $2n-4$ two-qutrit conditional swap gates, a single qutrit-qubit controlled phase gate, and two single-qutrit operations. Unlike previous schemes, our scheme uses the auxiliary level to "expose" some state to the qutrit-qubit controlled phase gate, instead of using it to "hide" states from the conditional dynamics. Neither the number of the additional levels nor that of single-qutrit operations needs to increase with $n$. We propose a physical implementation of the required elementary g…
We demonstrate the transition from local to global noise in a two-qubit all-optical quantum simulator subject to classical random fluctuations. Qubits are encoded in the polarization degree of freedom of two entangled photons generated by parametric down-conversion (PDC) while the environment is implemented using their spatial degrees of freedom. The ability to manipulate with high accuracy the number of correlated pixels of a spatial-light-modulator and the spectral PDC width, allows us to control the transition from a scenario where the qubits are embedded in local environments to the situat…
An explicit scheme (quantum circuit) is designed for the teleportation of an $n$-qubit quantum state. It is established that the proposed scheme requires an optimal amount of quantum resources, whereas larger amount of quantum resources has been used in a large number of recently reported teleportation schemes for the quantum states which can be viewed as special cases of the general $n$-qubit state considered here. A trade off between our knowledge about the quantum state to be teleported and the amount of quantum resources required for the same is observed. A proof of principle experimental …
Fast robust two-qubit gate operation with low susceptibility to crosstalk are the key to scalable quantum information processing. Parametrically driven gate is inherently insensitive to crosstalk while superadiabatic control can speed up the gate without losing accuracy. We propose and experimentally implement superadiabatic two-qubit gates using parametric modulation on superconducting quantum circuits. Our results demonstrate the preservation of adiabaticity at a gate speed close to the quantum limit, in addition to robustness against control instability. We demonstrate a CZ gate with error …
We present a novel method to realize a multi-target-qubit controlled phase gate with one microwave photonic qubit simultaneously controlling $n-1$ target microwave photonic qubits. This gate is implemented with $n$ microwave cavities coupled to a superconducting flux qutrit. Each cavity hosts a microwave photonic qubit, whose two logic states are represented by the vacuum state and the single photon state of a single cavity mode, respectively. During the gate operation, the qutrit remains in the ground state and thus decoherence from the qutrit is greatly suppressed. This proposal requires onl…
A fundamental requirement of quantum information processing is the protection from the adverse effects of decoherence and noise. Decoherence-free subspaces and geometric processing are important steps of quantum information protection. Here, we provide a new experimentally feasible scheme to combine decoherence-free subspaces with nonadiabatic geometric manipulations to attain a universal quantum computation. The proposed scheme is different from previous proposals and is based on the typical XY interaction coupling, which can be set up in various nano-engineered systems and therefore open up …
High-fidelity two-qubits gates are essential for the realization of large-scale quantum computation and simulation. Tunable coupler design is used to reduce the problem of parasitic coupling and frequency crowding in many-qubit systems and thus thought to be advantageous. Here we design a extensible 5-qubit system in which center transmon qubit can couple to every four near-neighbor qubit via a capacitive tunable coupler and experimentally demonstrate high-fidelity controlled-phase (CZ) gate by manipulating center qubit and one near-neighbor qubit. Speckle purity benchmarking (SPB) and cross e…
Realization of the quantum Toffoli gate with trapped ions
用于量子信息处理的算法通常被分解为量子门操作的序列，最常使用单量子比特门和双量子比特门来实现[1]。虽然这样的操作构成了量子计算的通用集合，但作用于两个以上量子比特的门可以简化复杂量子算法的实现[2]。因此，单个三量子位操作可以取代复杂的两量子位门序列，这反过来又保证了更快的执行速度和更高的保真度。一个重要的三量子位操作是量子Toffoli门，它根据两个控制量子位的状态对目标量子位执行NOT操作。在这里，我们提出了第一个实验实现的量子Toffoli门的离子阱量子计算机。我们的实现是特别有效的，因为我们直接编码的相关逻辑信息的离子串的运动。[1]Diplenenzo，D.两位门是量子计算的通用门。Cond-mat/9407022，Phys.Rev. A 51，1015-1022（1995）。[2]Chiaverini，J. et al.实现量子纠错. Nature 432，602-605（2004）.
We report the implementation of a perceptron quantum gate in an ion-trap quantum computer. In this scheme, a perceptron's target qubit changes its state depending on the interactions with several qubits. The target qubit displays a tunable sigmoid switching behaviour becoming a universal approximator when nested with other percetrons. The procedure consists on the adiabatic ramp-down of a dressing-field applied to the target qubit. We also use two successive perceptron quantum gates to implement a XNOR-gate, where the perceptron qubit changes its state only when the parity of two input qubits …
We realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The previously proposed Surface Code memories rely on error syndrome detection circuits based on CNOT gates. In a two-dimensional planar architecture, to realize a two-qubit CNOT gate in the presence of couplings to other neighboring qubits, the interaction of the target qubit with its three other neighbors must cancel out. Here we present a new error syndrome detection circuit utilizing multi-qubit pa…
Due to its geometric nature, holonomic quantum computation is fault-tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open challenge. In this Letter, we report the first experimental demonstration of nonadiabatic holonomic quantum computation in liquid NMR quantum information processors. Two non-commuting holonomic single-qubit gates, rotations about x-axis and about z-axis, and the two-qubit holonomic control-NOT gate are realized with high fidelity by evolving the work qubits a…
Based on a `shortcut-to-adiabaticity' (STA) scheme, we theoretically design and experimentally realize a set of high-fidelity single-qubit quantum gates in a superconducting Xmon qubit system. Through a precise microwave control, the qubit is driven to follow a fast `adiabatic' trajectory with the assistance of a counter-diabatic field and the correction of derivative removal by adiabatic gates. The experimental measurements of quantum process tomography and interleaved randomized benchmarking show that the process fidelities of our STA quantum gates are higher than 94.9% and the gate fideliti…
The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often leading to exponentially many gates to realize an arbitrary computational task. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits to implement the desired circuit. In 1995, Cirac and Zoller proposed a method to realize native multi-qubit controlled-$Z$ gates in trapped ion systems,…
Symmetric informationally complete positive operator-valued measurement (SIC-POVM) is one important class of quantum measurement which is crucial for various quantum information processing tasks. SIC-POVMs have the advantage of providing an unbiased estimator for quantum states with the minimal number of outcomes needed for full tomography. We present an experimental approach on a photonic quantum walk which can be used to implement SIC-POVMs on a single-qbubit. The projection measurements of single-photons' positions correspond to elements of SIC-POVM on the polarization of single-photons.
We report the first experimental generation and characterization of a six-photon Dicke state. The produced state shows a fidelity of F=0.56+/-0.02 with respect to an ideal Dicke state and violates a witness detecting genuine six-qubit entanglement by four standard deviations. We confirm characteristic Dicke properties of our resource and demonstrate its versatility by projecting out four- and five-photon Dicke states, as well as four-photon GHZ and W states. We also show that Dicke states have interesting applications in multiparty quantum networking protocols such as open-destination teleport…
The distribution of entangled states across the nodes of a future quantum internet will unlock fundamentally new technologies. Here we report on the experimental realization of a three-node entanglement-based quantum network. We combine remote quantum nodes based on diamond communication qubits into a scalable phase-stabilized architecture, supplemented with a robust memory qubit and local quantum logic. In addition, we achieve real-time communication and feed-forward gate operations across the network. We capitalize on the novel capabilities of this network to realize two canonical protocols …
A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic sum…
We realize Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on the IBM quantum computers. These channels correspond to interaction between the qutrit and its environment that result in the globally unitarily covariant qutrit transformation violating multiplicativity of the maximal $p$-norm. Our realization of LS and WH channels is based on embedding qutrit states into states of two qubits and using single-qubit and two-qubit CNOT gates to implement the specific interaction. We employ the standard quantum gates hence the developed algorithm suits any quantum computer. We…
Geometric phases are noise-resilient, and thus provide a robust way towards high fidelity quantum manipulation. Here we experimentally demonstrate arbitrary non-adiabatic holonomic single-qubit quantum gates for both a superconducting transmon qubit and a microwave cavity in a single-loop way. In both cases, an auxiliary state is utilized, and two resonant microwave drives are simultaneously applied with well-controlled but varying amplitudes and phases for the arbitrariness of the gate. The resulting gates on the transmon qubit achieve a fidelity of 0.996 characterized by randomized benchmark…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate. Based on two recent works, we construct two Hamiltonians and experimentally realized nonadiabatic holonomic gates by a single-shot implementation in a two-qubit nuclear magnetic resonance (NMR) system. Two noncommuting one-qubit holonomic gates, rotating along $\hat{x}$ and $\hat{z}$ axes respectively, are implemented by evolving a work qubit and a…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be used as a quantum channel for teleportation, as proposed by Wang, Shang and Xue [Quantum Inf. Process. 16, 221 (2017)]. Here, we demonstrate the implementation of quantum teleportation using quantum walks on a five-qubit quantum computer and a 32-qubit simulator provided by IBM quantum experience beta platform. We show the teleportation of single-qubit, two…
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the number of qubits. In a certain scaling limit, we show that a large number of steps is implemented with a number of quantum gates which is independent of the number of steps. We ran the quantum algorithm on the IBM-Q five-qubit quantum computer, thus experimentally demonstrating topological features, such as boundary bound states, on a lattice with $N=4$ point…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. In order to test our results experimentally, we utilize IBM's $5$-qubit quantum processor to realize the algorithm …
