Creating decoherence-free subspaces using strong and fast pulses

A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast ["bang-bang" (BB)] pulses that create the conditions allowing for the existence of DFSs that support scalable, universal quantum computation. One such example is the creation of the conditions for collective decoherence, wherein all system particles are coupled in an identical manner to their environment. The BB pulses needed for this are generated using only the Heisenberg exchange interaction. In conjunction with previous results, this shows that Heisenberg exchange is by itself an enabler of universal fault-tolerant quantum computation on DFSs.     

Ensemble quantum computation with atoms in periodic potentials

We show how to perform universal quantum computation with atoms confined in optical lattices which works both in the presence of defects and without individual addressing. The method is based on using the defects in the lattice, wherever they are, both to "mark" different copies on which ensemble quantum computation is carried out and to define pointer atoms which perform the quantum gates. We also show how to overcome the problem of scalability in this system.     

Globally controlled quantum wires for perfect qubit transport, mirroring, and computing

We describe a new design for a q wire with perfect transmission using a uniformly coupled Ising spin chain subject to global pulses. In addition to allowing for the perfect transport of single qubits, the design also yields the perfect "mirroring" of multiply encoded qubits within the wire. We further utilize this global-pulse generated perfect mirror operation as a "clock cycle" to perform universal quantum computation on these multiply encoded qubits where the interior of the q wire serves as the quantum memory while the q-wire ends perform one- and two-qubit gates.     

Quantum computation with untunable couplings

Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme to remove the necessity of switching the couplings between qubits for two bit gates, which are more costly in many cases. Our strategy is to compute with encoded qubits in and out of carefully designed interaction free subspaces analogous to decoherence free subspaces. We give two examples to show how universal quantum computation is realized in our scheme with local manipulations to physical qubits only, for both diagonal and off diagonal interactions.     

利用光子回声技术产生光的三体纠缠态的研究

量子纠缠是实现量子通信和量子计算的重要资源,其中多体纠缠更是构建量子网络实现全局量子计算的基础。本文主要研究如何利用经典的光子回声技术实现光量子态的三体纠缠。在自由空间中向掺杂稀土离子的固态离子系综中射入经典光场,当离子体系达到相位重构条件时即可获得三束存在纠缠的量子光场。基于本方案纠缠产生的技术特点,发现其在提高量子中继器的工作效率上有着潜在的应用价值。     

Charge qubits and limitations of electrostatic quantum gates

We investigate quantum dot arrays and their application to quantum computation. The arrays analyzed contain a total of a few operating electrons with constant tunneling between the dots. We construct quantum two-level systems near the ground state with a large energy separation to the remainder of the states and with the electrostatic interaction modeled within the capacitance matrix formalism. A set of representative examples is investigated numerically.     

How to decompose arbitrary continuous-variable quantum operations

We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multimode Hamiltonian evolution, into a set of universal unitary gates. Although our approach is mainly oriented towards continuous-variable quantum computation, it may be used more generally whenever quantum states are to be transformed deterministically, e.g., in quantum control, discrete-variable quantum computation, or Hamiltonian simulation. We illustrate our scheme by presenting decompositions for various nonlinear Hamiltonians including quartic Kerr interactions. Finally, we conclude with two potential experiments utilizing offline-prepared optical cubic states and homodyne detections, in which quantum information is processed optically or in an atomic memory using quadratic light-atom interactions.     

Experimental realization of decoherence-free subspace in neutron interferometry

A decoherence-free subspace (DFS) is an important class of quantum-error-correcting (QEC) codes that have been proposed for fault-tolerant quantum computation. The applications of QEC techniques, however, are not limited to quantum-information processing (QIP). Here we demonstrate how QEC codes may be used to improve experimental designs of quantum devices to achieve noise suppression. In particular, neutron interferometry is used as a test bed to show the potential for adding quantum error correction to quantum measurements. We built a five-blade neutron interferometer that incorporates both a standard Mach-Zender configuration and a configuration based on a DFS. Experiments verify that the DFS interferometer is protected against low-frequency mechanical vibrations. We anticipate these improvements will increase the range of applications for matter-wave interferometry.     

Universal quantum computation with continuous-variable cluster states

We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multimode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.     

Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme

Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly,the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.     

中性原子量子计算研究进展

相互作用可控、相干时间较长的中性单原子体系具备在1 mm2的面积上提供成千上万个量子比特的规模化集成的优势,是进行量子模拟、实现量子计算的有力候选者.近几年中性单原子体系在实验上取得了快速的发展,完成了包括50个单原子的确定性装载、二维和三维阵列中单个原子的寻址和操控、量子比特相干时间的延长、基于里德伯态的两比特量子门的实现和原子态的高效读出等,这些工作极大地推动了该体系在量子模拟和量子计算方面的应用.本文综述了该体系在量子计算方面的研究进展,并介绍了我们在其中所做的两个贡献:一是实现了"魔幻强度光阱",克服了光阱中原子退相干的首要因素,将原子相干时间提高了百倍,使得相干时间与比特操作时间的比值高达105;二是利用异核原子共振频率的差异建立了低串扰的异核单原子体系,并利用里德伯阻塞效应首次实现了异核两原子的量子受控非门和量子纠缠,将量子计算的实验研究拓展至异核领域.最后,分析了中性单原子体系在量子模拟和量子计算方面进一步发展面临的挑战与瓶颈.     

Asymptotically optimal quantum circuits for d-level systems

Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many d-level systems (qudits). Both a lower bound and a constructive upper bound on the number of two-qudit gates result, proving a sharp asymptotic of theta(d(2n)) gates. This closes the complexity question for all d-level systems (d finite). The optimal asymptotic applies to systems with locality constraints, e.g., nearest neighbor interactions.     

Topological computation without braiding

We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net condensates in 3-colexes. The universal set of gates is implemented without selective addressing of physical qubits and, being fully topologically protected, it does not rely on quasiparticle excitations or their braiding.     

Experimental observations of boundary conditions of continuous-time quantum walks

The continuous-time quantum walk(CTQW) is the quantum analogue of the continuous-time classical walk and is widely used in universal quantum computations. Here, taking the advantages of the waveguide arrays, we implement large-scale CTQWs on chips. We couple the single-photon source into the middle port of the waveguide arrays and measure the emergent photon number distributions by utilizing the fiber coupling platform. Subsequently, we simulate the photon number distributions of the waveguide arrays by considering the boundary conditions. The boundary conditions are quite necessary in solving the problems of quantum mazes.     

Spectroscopic study of self and buffer gas broadened CO2 overtone transitions at 780 nm by NIR diode laser spectrometer

We propose a scheme to achieve quantum gate operations within decoherence-free subspace (DFS) using nitrogen-vacancy centers in separate diamond nanocrystals coupled to a whispering-gallery mode resonator. By virtue of Raman transitions in the dispersive regime, we present two different methods for realizing quantum gating within DFS in a deterministic way. The quantum gating is seriously treated by considering all kinds of decoherence mechanisms, and the experimental feasibility is achieved using currently available technology.     

Towards fault tolerant adiabatic quantum computation

I show how to protect adiabatic quantum computation (AQC) against decoherence and certain control errors, using a hybrid methodology involving dynamical decoupling, subsystem and stabilizer codes, and energy gaps. Corresponding error bounds are derived. As an example, I show how to perform decoherence-protected AQC against local noise using at most two-body interactions.     

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.     

Analysis and improvement of verifiable blind quantum computation

In blind quantum computation (BQC), a client with weak quantum computation capabilities is allowed to delegate its quantum computation tasks to a server with powerful quantum computation capabilities, and the inputs, algorithms and outputs of the quantum computation are confidential to the server. Verifiability refers to the ability of the client to verify with a certain probability whether the server has executed the protocol correctly and can be realized by introducing trap qubits into the computation graph state to detect server deception. The existing verifiable universal BQC protocols are analyzed and compared in detail. The XTH protocol (proposed by Xu Q S, Tan X Q, Huang R in 2020), a recent improvement protocol of verifiable universal BQC, uses a sandglass-like graph state to further decrease resource expenditure and enhance verification capability. However, the XTH protocol has two shortcomings: limitations in the coloring scheme and a high probability of accepting an incorrect computation result. In this paper, we present an improved version of the XTH protocol, which revises the limitations of the original coloring scheme and further improves the verification ability. The analysis demonstrates that the resource expenditure is the same as for the XTH protocol, while the probability of accepting the wrong computation result is reduced from the original minimum (0.866)^d* to (0.819)^d*, where d^* is the number of repeated executions of the protocol.     

Realization of arbitrary two-qubit quantum gates based on chiral Majorana fermions

Quantum computers are in hot-spot with the potential to handle more complex problems than classical computers can.Realizing the quantum computation requires the universal quantum gate set {T,H,CNOT} so as to perform any unitary transformation with arbitrary accuracy.Here we first briefly review the Majorana fermions and then propose the realization of arbitrary two-qubit quantum gates based on chiral Majorana fermions.Elementary cells consist of a quantum anomalous Hall insulator surrounded by a topological superconductor with electric gates and quantum-dot structures,which enable the braiding operation and the partial exchange operation.After defining a qubit by four chiral Majorana fermions,the singlequbit T and H quantum gates are realized via one partial exchange operation and three braiding operations,respectively.The entangled CNOT quantum gate is performed by braiding six chiral Majorana fermions.Besides,we design a powerful device with which arbitrary two-qubit quantum gates can be realized and take the quantum Fourier transform as an example to show that several quantum operations can be performed with this space-limited device.Thus,our proposal could inspire further utilization of mobile chiral Majorana edge states for faster quantum computation.     

A no-go theorem for halting a universal quantum computer

A very brief introduction to quantum computing with an emphasis on the distinction between universal quantum computers and quantum networks. We then prove that, under very general and desirable assumptions, it is not possible to check for halting a universal quantum computer without losing the quantum computation.