固态量子计算的若干重要物理问题研究

量子计算机拥有比经典计算机更为强大的计算能力．人们普遍认为量子计算机最终将会在固态系统中实现．文章介绍了一些有关固态量子计算的研究进展，其中包括超导电荷量子比特方案、几何量子计算、量子点量子比特及量子计算若干基本问题研究．最后给出了固态量子计算的发展趋势．     

Information,physics, and computation

This paper presents several observations on the connections between information, physics, and computation. In particular, the computing power of quantum computers is examined. Quantum theory is characterized by superimposed states and nonlocal interactions. It is argued that recently studied quantum computers, which are based on local interactions, cannot simulate quantum physics.     

Tensor product of frame manuals

Since its first use, there has been widespread dissatisfaction with the Hilbert-space tensor product as a device for coupling the Hilbert-space models of two separated quantum mechanical systems. The Hilbert-space model is paraphrased manual-theoretically by the assertion that quantum mechanical entities are represented by frame manuals. There is a natural, heuristically straightforward tensor product for (unital) manuals, and it is natural therefore to ask whether the tensor product of frame manuals might serve as an alternative model of separated quantum mechanical systems. It is shown that the states on a tensor product of complex frame manuals give rise uniquely to sesquilinear forms on the tensor product of the underlying Hibert spaces. In certain cases, these in turn give rise to operators, which, however, are not generally positive, and which, even if compact, need not be trace-class.     

固态量子计算

量子计算机拥有比经典计算机更强大的计算能力，人们普遍认为，量子计算机最终将会在固态系统中实现，文章介绍了三种固态量子计算机的方案，它们分别基于固态核振磁共振，超导结和量子点。     

A Multi-Classification Hybrid Quantum Neural Network Using an All-Qubit Multi-Observable Measurement Strategy

Quantum machine learning is a promising application of quantum computing for data classification. However, most of the previous research focused on binary classification, and there are few studies on multi-classification. The major challenge comes from the limitations of near-term quantum devices on the number of qubits and the size of quantum circuits. In this paper, we propose a hybrid quantum neural network to implement multi-classification of a real-world dataset. We use an average pooling downsampling strategy to reduce the dimensionality of samples, and we design a ladder-like parameterized quantum circuit to disentangle the input states. Besides this, we adopt an all-qubit multi-observable measurement strategy to capture sufficient hidden information from the quantum system. The experimental results show that our algorithm outperforms the classical neural network and performs especially well on different multi-class datasets, which provides some enlightenment for the application of quantum computing to real-world data on near-term quantum processors.     

超导量子计算核心器件

算力是数字经济时代新的生产力。量子计算基于量子力学的规律进行计算,人们普遍相信它可以在不久的将来在某些问题上完成经典计算机所无法完成的计算任务,实现量子优越性。作为最有可能实现通用量子计算的平台之一,以约瑟夫森结为核心元件的超导量子比特,在量子控制和量子测量方面具有稳定、可靠、便于设计和扩展等独特的优势,受到科学界甚至产业界的广泛关注,正在高速发展。文章围绕约瑟夫森结这一具有非线性和无耗散特征的超导量子器件,阐述了超导量子比特的基本原理及结构特征,重点介绍超导量子芯片设计、加工方面的前沿进展,并对未来发展方向进行简单的展望。     

Vacuum structures in Hamiltonian light-front dynamics

Hamiltonian light-front dynamics of quantum fields may provide a useful approach to systematic nonperturbative approximations to quantum field theories. We investigate inequivalent Hilbert-space representations of the light-front field algebra in which the stability group of the light front is implemented by unitary transformations. The Hilbert space representation of states is generated by the operator algebra from the vacuum state. There is a large class of vacuum states besides the Fock vacuum which meet all the invariance requirements. The light-front Hamiltonian must annihilate the vacuum and have a positive spectrum. We exhibit relations of the Hamiltonian to the nontrivial vacuum structure.     

Statistical constraints on state preparation for a quantum computer

Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. We show that the constraints of quantum statistics require that the entropy of the system be brought down when several independent qubits are assembled together. In particular, we have: (i) not all initial states are realizable as pure states; (ii) the temperature of the system must be reduced. These factors, in addition to decoherence and sensitivity to errors, must be considered in the implementation of quantum computers.     

A one-way quantum computer

We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.     

Variational quantum simulation of thermal statistical states on a superconducting quantum processer

Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg $XX$ and $XXZ$ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum-classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits, revealing its potential in solving large-scale problems.     

Entropy of Quantum States

Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a minimality property of the von Neumann entropy of a density matrix with respect to its possible decompositions into pure states, we give a purely algebraic definition of entropy for states of an algebra of observables, thus solving the above ambiguity. The entropy so-defined satisfies all the desirable thermodynamic properties and reduces to the von Neumann entropy in the quantum mechanical case. Moreover, it can be shown to be equal to the von Neumann entropy of the unique representative density matrix belonging to the operator algebra of a multiplicity-free Hilbert-space representation.     

Optimal subsystem approach to multi-qubit quantum state discrimination and experimental investigation

Quantum computing is a significant computing capability which is superior to classical computing because of its superposition feature. Distinguishing several quantum states from quantum algorithm outputs is often a vital computational task. In most cases, the quantum states tend to be non-orthogonal due to superposition; quantum mechanics has proved that perfect outcomes could not be achieved by measurements, forcing repetitive measurement. Hence, it is important to determine the optimum measuring method which requires fewer repetitions and a lower error rate. However, extending current measurement approaches mainly aiming at quantum cryptography to multi-qubit situations for quantum computing confronts challenges, such as conducting global operations which has considerable costs in the experimental realm. Therefore, in this study, we have proposed an optimum subsystem method to avoid these difficulties. We have provided an analysis of the comparison between the reduced subsystem method and the global minimum error method for two-qubit problems; the conclusions have been verified experimentally. The results showed that the subsystem method could effectively discriminate non-orthogonal two-qubit states, such as separable states, entangled pure states, and mixed states; the cost of the experimental process had been significantly reduced, in most circumstances, with acceptable error rate. We believe the optimal subsystem method is the most valuable and promising approach for multi-qubit quantum computing applications.     

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.     

Superoperator nonequilibrium Green’s function theory of many-body systems; applications to charge transfer and transport in open junctions

Nonequilibrium Green’s functions provide a powerful tool for computing the dynamical response and particle exchange statistics of coupled quantum systems. We formulate the theory in terms of the density matrix in Liouville space and introduce superoperator algebra that greatly simplifies the derivation and the physical interpretation of all quantities. Expressions for various observables are derived directly in real time in terms of superoperator nonequilibrium Green’s functions (SNGF), rather than the artificial time-loop required in Schwinger’s Hilbert-space formulation. Applications for computing interaction energies, charge densities, average currents, current induced fluorescence, electroluminescence and current fluctuation (electron counting) statistics are discussed.     

Virtual parallel computing and a search algorithm using matrix product States

We propose a form of parallel computing on classical computers that is based on matrix product states. The virtual parallelization is accomplished by representing bits with matrices and by evolving these matrices from an initial product state that encodes multiple inputs. Matrix evolution follows from the sequential application of gates, as in a logical circuit. The action by classical probabilistic one-bit and deterministic two-bit gates such as NAND are implemented in terms of matrix operations and, as opposed to quantum computing, it is possible to copy bits. We present a way to explore this method of computation to solve search problems and count the number of solutions. We argue that if the classical computational cost of testing solutions (witnesses) requires less than O(n^{2}) local two-bit gates acting on n bits, the search problem can be fully solved in subexponential time. Therefore, for this restricted type of search problem, the virtual parallelization scheme is faster than Grover's quantum algorithm.     

Selected topics of quantum computing for nuclear physics

Nuclear physics,whose underling theory is described by quantum gauge field coupled with matter,is fundamentally important and yet is formidably challenge for simulation with classical computers.Quantum computing provides a perhaps transformative approach for studying and understanding nuclear physics.With rapid scaling-up of quantum processors as well as advances on quantum algorithms,the digital quantum simulation approach for simulating quantum gauge fields and nuclear physics has gained lots of attention.In this review,we aim to summarize recent efforts on solving nuclear physics with quantum computers.We first discuss a formulation of nuclear physics in the language of quantum computing.In particular,we review how quantum gauge fields(both Abelian and non-Abelian)and their coupling to matter field can be mapped and studied on a quantum computer.We then introduce related quantum algorithms for solving static properties and real-time evolution for quantum systems,and show their applications for a broad range of problems in nuclear physics,including simulation of lattice gauge field,solving nucleon and nuclear structures,quantum advantage for simulating scattering in quantum field theory,non-equilibrium dynamics,and so on.Finally,a short outlook on future work is given.     

Two-Qubit Quantum Logic Gate in Molecular Magnets

We propose a scheme to realize a controlled-NOT quantum logic gate in a dimer of exchange coupled singlemolecule magnets, [Mn4]2. We chosen the ground state and the three low-lying excited states of a dimer in a finite longitudinal magnetic field as the quantum computing bases and introduced a pulsed transverse magnetic field with a special frequency. The pulsed transverse magnetic field induces the transitions between the quantum computing bases so as to realize a controlled-NOT quantum logic gate. The transition rates between a pair of the four quantum computing bases and between the quantum computing bases and excited states are evaluated and analysed.     

Universality of black hole quantum computing

By analyzing the key properties of black holes from the point of view of quantum information, we derive a model‐independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with quantum critical condensates, allowing the use of a common language to describe quantum computing in both systems. We analyze such quantum computing by allowing coupling to external modes, under the condition that the external influence must be soft‐enough in order not to offset the basic properties of the system. We derive model‐independent bounds on some crucial time‐scales, such as the times of gate operation, decoherence, maximal entanglement and total scrambling. We show that for black hole type quantum computers all these time‐scales are of the order of the black hole half‐life time. Furthermore, we construct explicitly a set of Hamiltonians that generates a universal set of quantum gates for the black hole type computer. We find that the gates work at maximal energy efficiency. Furthermore, we establish a fundamental bound on the complexity of quantum circuits encoded on these systems, and characterize the unitary operations that are implementable. It becomes apparent that the computational power is very limited due to the fact that the black hole life‐time is of the same order of the gate operation time. As a consequence, it is impossible to retrieve its information, within the life‐time of a black hole, by externally coupling to the black hole qubits. However, we show that, in principle, coupling to some of the internal degrees of freedom allows acquiring knowledge about the micro‐state. Still, due to the trivial complexity of operations that can be performed, there is no time advantage over the collection of Hawking radiation and subsequent decoding.     

Computational difficulty of computing the density of states

We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class quantum Merlin Arthur. We show that #BQP is not harder than its classical counting counterpart #P, which in turn implies that computing the ground state degeneracy or the density of states for classical Hamiltonians is just as hard as it is for quantum Hamiltonians.