Universal quantum computation through control of spin-orbit coupling

We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins, including the anisotropic corrections due to spin-orbit coupling. Control over these corrections, even if limited, is sufficient for universal quantum computation over qubits encoded into pairs of electron spins. The number of voltage pulses required to carry out either single-qubit rotations or controlled-Not gates scales as the inverse of a dimensionless measure of the degree of control of spin-orbit coupling.     

Universal quantum control based on parametric modulation in superconducting circuits

As superconducting quantum circuits are scaling up rapidly towards the noisy intermediate-scale quantum(NISQ)era, the demand for electronic control equipment has increased significantly. To fully control a quantum chip of N qubits,the common method based on up-conversion technology costs at least 2 × N digital-to-analog converters(DACs) and N IQ mixers. The expenses and complicate mixer calibration have become a hinderance for intermediate-scale quantum control.Here we propose a universal control scheme for superconducting circuits, fully based on parametric modulation. To control N qubits on a chip, our scheme only requires N DACs and no IQ mixer, which significantly reduces the expenses. One key idea in the control scheme is to introduce a global pump signal for single-qubit gates. We theoretically explain how the universal gates are constructed using parametric modulation. The fidelity analysis shows that parametric single-qubit(two-qubit) gates in the proposed scheme can achieve low error rates of 10~(4), with a gate time of about 60 ns(100 ns).     

High fidelity quantum gates via dynamical decoupling

Realizing the theoretical promise of quantum computers will require overcoming decoherence. Here we demonstrate numerically that high fidelity quantum gates are possible within a framework of quantum dynamical decoupling. Orders of magnitude improvement in the fidelities of a universal set of quantum gates, relative to unprotected evolution, is achieved over a broad range of system-environment coupling strengths, using recursively constructed (concatenated) dynamical decoupling pulse sequences.     

Zeno effect for quantum computation and control

It is well known that the quantum Zeno effect can protect specific quantum states from decoherence by using projective measurements. Here we combine the theory of weak measurements with stabilizer quantum error correction and detection codes. We derive rigorous performance bounds which demonstrate that the Zeno effect can be used to protect appropriately encoded arbitrary states to arbitrary accuracy while at the same time allowing for universal quantum computation or quantum control.     

Holonomic quantum computation in decoherence-free subspaces

We show how to realize, by means of non-Abelian quantum holonomies, a set of universal quantum gates acting on decoherence-free subspaces and subsystems. In this manner we bring together the quantum coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of all-geometric holonomic control. We discuss the implementation of this scheme in the context of quantum information processing using trapped ions and quantum dots.     

高维辅助的普适量子线路优化

受到Lanyon等(Lanyon B P et al 2008 Nature Physics. 5 134)利用高维Hilbert空间成功简化Toffoli门的启发, 本文将辅助维度应用到普适量子线路中, 结合Cosine-Sine Decomposition(CSD), Quantum Shannon Decomposition(QSD)等矩阵分解方法, 优化了两比特和三比特普适幺正量子线路, 给出了计算n比特普适量子线路复杂度的公式, 并利用线性光学和腔QED系统设计了实验方案. 结果表明, 两比特和三比特量子线路的复杂度已分别接近和优于目前最优结果, 且随着比特数的增加, 本方案的优势愈加明显.     

Programmable quantum processor implemented with superconducting circuit

A quantum processor might execute certain computational tasks exponentially faster than a classical processor. Here, using superconducting quantum circuits we design a powerful universal quantum processor with the structure of symmetric all-to-all capacitive connection. We present the Hamiltonian and use it to demonstrate a full set of qubit operations needed in the programmable universal quantum computations. With the device the unwanted crosstalk and ZZ-type couplings between qubits can be effectively suppressed by tuning gate voltages, and the design allows efficient and high-quality couplings of qubits. Within available technology,the scheme may enable a practical programmable universal quantum computer.     

Benchmarking quantum control methods on a 12-qubit system

In this Letter, we present an experimental benchmark of operational control methods in quantum information processors extended up to 12 qubits. We implement universal control of this large Hilbert space using two complementary approaches and discuss their accuracy and scalability. Despite decoherence, we were able to reach a 12-coherence state (or a 12-qubit pseudopure cat state) and decode it into an 11 qubit plus one qutrit pseudopure state using liquid state nuclear magnetic resonance quantum information processors.     

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.     

A prototype of quantum von Neumann architecture

A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. It requires a thorough understanding of the physics of information storage, processing, protection, readout, etc. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far, namely, quantum algorithms are stored and controlled classically, and mainly the executions of them are quantum, leading to the so-called quantum processing units. Such a quantum–classical hybrid is constrained by its classical ingredients, and cannot reveal the computational power of a fully quantum computer system as conceived from the beginning of the field. Recently, the nature of quantum information has been further recognized, such as the no-programming and no-control theorems, and the unifying understandings of quantum algorithms and computing models. As a result, in this work, we propose a model of a universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits (i.e. Bell states) as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. As a digital quantum system, its global configurations can be viewed as tensor-network states. Its universality is proved by the capability to execute quantum algorithms based on a program composition scheme via a universal quantum gate teleportation. It is also protected by the uncertainty principle, the fundamental law of quantum information, making it quantum-secure and distinct from the classical case. In particular, we introduce a few variants of quantum circuits, including the tailed, nested, and topological ones, to characterize the roles of quantum memory and control, which could also be of independent interest in other contexts. In all, our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems in the near future.     

Universal R Matrix of Two-Parameter Deformed Quantum Group Uqs(SU(1, 1))

The universal R matrix of the two-parameterdeformed quantum group U_qs(SU(1, 1)) isderived. In previous work we suggested a method toderive the universal R matrix of the two-parameterdeformed quantum group U_qs(SU(2)). This method isdifferent from that of the quantum double; it is simpleand efficient for quantum groups of low rank at least.This paper studies the universal R matrix of thetwo-parameter deformed quantum group U_qs(SU(1, 1))using the same approach.     

Cavity-assisted quantum computing in a silicon nanostructure

We present a scheme of quantum computing with charge qubits corresponding to one excess electron shared between dangling-bond pairs of surface silicon atoms that couple to a microwave stripline resonator on a chip. By choosing a certain evolution time, we propose the realization of a set of universal single-and two-qubit logical gates. Due to its intrinsic stability and scalability, the silicon dangling-bond charge qubit can be regarded as one of the most promising candidates for quantum computation. Compared to the previous schemes on quantum computing with silicon bulk systems, our scheme shows such advantages as a long coherent time and direct control and readout.     

Quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters

This paper is concerned with construction of quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters. The boson-fermion correspondence for these symmetric functions have been presented. In virtue of quantum fields, we derive a series of infinite order nonlinear integrable equations, namely, universal character hierarchy, symplectic KP hierarchy and symplectic universal character hierarchy, respectively. In addition, the solutions of these integrable systems have been discussed.     

Wavefunctions for topological quantum registers

We present explicit wavefunctions for quasi-hole excitations over a variety of non-abelian quantum Hall states: the Read-Rezayi states with k ? 3 clustering properties and a paired spin-singlet quantum Hall state. Quasi-holes over these states constitute a topological quantum register, which can be addressed by braiding quasi-holes. We obtain the braid properties by direct inspection of the quasi-hole wavefunctions. We establish that the braid properties for the paired spin-singlet state are those of ‘Fibonacci anyons’, and thus suitable for universal quantum computation. Our derivations in this paper rely on explicit computations in the parafermionic conformal field theories that underly these particular quantum Hall states.     

On the quantum groupSL q (2)

We start with the observation that the quantum groupSL _q (2), described in terms of the algebra of functions has a quantum subgroup, which is just a usual Cartan group. Based on this observation, we develop a general method of constructing quantum groups with similar property. We also develop this method in the language of quantized universal enveloping algebras, which is another common method of studying quantum groups. We carry out our method in detail for root systems of typeSL(2); as a byproduct, we find a new series of quantum groups-metaplectic groups ofSL(2)-type. Representations of these groups can provide interesting examples of bimodule categories over monoidal category of representations ofSL _q (2).     

Nonlinear transport near a quantum phase transition in two dimensions

The problem of nonlinear transport near a quantum phase transition is solved within the Landau theory for the dissipative insulator-superconductor phase transition in two dimensions. Using the nonequilibrium Schwinger round-trip Green function formalism, we obtain the scaling function for the nonlinear conductivity in the quantum-disordered regime. We find that the conductivity scales as E2 at low fields but crosses over at large fields to a universal constant on the order of e(2)/h. The crossover between these two regimes obtains when the length scale for the quantum fluctuations becomes comparable to that of the electric field within logarithmic accuracy.     

Noisy intermediate-scale quantum computers

Quantum computers have made extraordinary progress over the past decade, and significant milestones have been achieved along the path of pursuing universal fault-tolerant quantum computers. Quantum advantage, the tipping point heralding the quantum era, has been accomplished along with several waves of breakthroughs. Quantum hardware has become more integrated and architectural compared to its toddler days. The controlling precision of various physical systems is pushed beyond the fault-tolerant threshold. Meanwhile, quantum computation research has established a new norm by embracing industrialization and commercialization. The joint power of governments, private investors, and tech companies has significantly shaped a new vibrant environment that accelerates the development of this field, now at the beginning of the noisy intermediate-scale quantum era. Here, we first discuss the progress achieved in the field of quantum computation by reviewing the most important algorithms and advances in the most promising technical routes, and then summarizing the next-stage challenges. Furthermore, we illustrate our confidence that solid foundations have been built for the fault-tolerant quantum computer and our optimism that the emergence of quantum killer applications essential for human society shall happen in the future.     

Factoring larger integers with fewer qubits via quantum annealing with optimized parameters

RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard(and hence intractable) problem for a classical computer. However, Shor's algorithm shows that its complexity is polynomial for a quantum computer, although technical difficulties mean that practical quantum computers that can tackle integer factorizations of meaningful size are still a long way away. Recently, Jiang et al. proposed a transformation that maps the integer factorization problem onto the quadratic unconstrained binary optimization(QUBO) model. They tested their algorithm on a D-Wave 2000 Q quantum annealing machine, raising the record for a quantum factorized integer to 376289 with only 94 qubits. In this study, we optimize the problem Hamiltonian to reduce the number of qubits involved in the final Hamiltonian while maintaining the QUBO coefficients in a reasonable range, enabling the improved algorithm to factorize larger integers with fewer qubits. Tests of our improved algorithm using D-Wave's hybrid quantum/classical simulator qbsolv confirmed that performance was improved, and we were able to factorize 1005973, a new record for quantum factorized integers, with only 89 qubits. In addition, our improved algorithm can tolerate more errors than the original one. Factoring 1005973 using Shor's algorithm would require about 41 universal qubits,which current universal quantum computers cannot reach with acceptable accuracy. In theory, the latest IBM Q System OneTM(Jan. 2019) can only factor up to 10-bit integers, while the D-Wave have a thousand-fold advantage on the factoring scale. This shows that quantum annealing machines, such as those by D-Wave, may be close to cracking practical RSA codes, while universal quantum-circuit-based computers may be many years away from attacking RSA.     

Thermodynamic effects of single-qubit operations in silicon-based quantum computing

Silicon-based quantum logic is a promising technology to implement universal quantum computing. It is widely believed that a millikelvin cryogenic environment will be necessary to accommodate silicon-based qubits. This prompts a question of the ultimate scalability of the technology due to finite cooling capacity of refrigeration systems. In this work, we answer this question by studying energy dissipation due to interactions between nuclear spin impurities and qubit control pulses. We demonstrate that this interaction constrains the sustainable number of single-qubit operations per second for a given cooling capacity.