Remarks on Universal Quantum Computer

Universal quantum logic gates in a scalable Ising spin quantum computer

We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total spin of isolators is 0. There are no need of complicated protocols for correcting the phase and probability errors due to permanent interaction between the qubits. We present protocols for implementation of universal quantum gates with the rectangular radio-frequency pulses.

Method for implementation of universal quantum logic gates in a scalable Ising spin quantum computer

We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. The phase and probability errors caused by unwanted transitions are minimized and computed numerically.

Clifford algebras, noncommutative tori and universal quantum computers

Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presented the joint consideration and comparison of both cases together with some discussion on possible physic…

Quantum Nondemolition Monitoring of Universal Quantum Computers

The halt scheme for quantum Turing machines, originally proposed by Deutsch, is reformulated precisely and is proved to work without spoiling the computation. The ``conflict'' pointed out recently by Myers in the definition of a universal quantum computer is shown to be only apparent. In the context of quantum nondemolition (QND) measurement, it is also shown that the output observable, an observable representing the output of the computation, is a QND observable and that the halt scheme is equivalent to the QND monitoring of the output observable.

In situ upgrade of quantum simulators to universal computers

Quantum simulators, machines that can replicate the dynamics of quantum systems, are being built as useful devices and are seen as a stepping stone to universal quantum computers. A key difference between the two is that computers have the ability to perform the logic gates that make up algorithms. We propose a method for learning how to construct these gates efficiently by using the simulator to perform optimal control on itself. This bypasses two major problems of purely classical approaches to the control problem: the need to have an accurate model of the system, and a classical computer mo…

Realizable Hamiltonians for Universal Adiabatic Quantum Computers

It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working towards the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known QMA-complete 2-local Hamiltonians. The 2-local Ising model with 1-local …

Universality and programmability of quantum computers

Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. The problem of universality has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani as well as Kitaev and Solovay. The quantum logic circuit model, developed by Feynman and Deutsch, has been more prominent in the research literature than Deutsch's quantum Turing mach…

Level-rank duality for a Universal Topological Quantum Computer

It is shown, using level-rank duality that a universal topological quantum computer based on Chern-Simons theory for SU(2)$_3$ also implies an analogous universal quantum computer based on SU(3)$_2$. Suggestions are made for the possible role of level-rank duality in entanglement from topology.

Signal-based classical emulation of a universal quantum computer

In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g., acoustic, electromagnetic, etc), but we focus our discussion here on electronic signals. Unitary gate operations are performed using analog electronic circuit devices, such as four-quadrant multipliers, operational amplifiers, and analog filters, although non-unitary operations may be performed as well. In this manner, the Hilbert space structure of …

16-qubit IBM universal quantum computer can be fully entangled

Entanglement is an important evidence that a quantum device can potentially solve problems intractable for classical computers. In this paper, we prepare connected graph states involving 8 to 16 qubits on ibmqx5, a 16-qubit superconducting quantum processor accessible via IBM cloud,using low-depth circuits. We demonstrate that the prepared state is fully entangled, i.e. the state is inseparable with respect to any fixed partition.

Encoded Universality in Physical Implementations of a Quantum Computer

We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical…

Remarks on the nature of quantum computation

Two models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the exponential speed-up of quantum computations possess their classical counterparts for the hybrid digital-analog computer. It is argued that the measurement errors which cannot be fully corrected make the computation not efficient for both models.

通用量子计算机中基于交换测试的量子过程表征

Swap Test-based Characterization of Quantum Processes in Universal Quantum Computers

本文研究通用量子计算机中噪声导致的退相干问题，验证 Swap Test 能否识别退相干，实验表明在特定条件下经修改后可作为不破坏被测量子比特的量子过程层析替代方案。

Efficient universal quantum channel simulation in IBM's cloud quantum computer

The study of quantum channels is the fundamental field and promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. Inspired by the method performing non-unitary operator by the linear combination of unitary operations, we proposed a quantum algorithm for the simulation of universal single-qubit channel, described by a convex combination of 'quasiextreme' channels corresponding to four Kraus operators, and is scalable to arbitrary higher dimension. We demonstrate the whole algorithm experimentall…

More Optimal Simulation of Universal Quantum Computers

Validating whether a quantum device confers a computational advantage often requires classical simulation of its outcomes. The worst-case sampling cost of $L_1$-norm based simulation has plateaued at $\le(2+\sqrt{2})ξ_t δ^{-1}$ in the limit that $t \rightarrow \infty$, where $δ$ is the additive error and $ξ_t$ is the stabilizer extent of a $t$-qubit magic state. We reduce this prefactor 68-fold by a leading-order reduction in $t$ through correlated sampling. The result exceeds even the average-case of the prior state-of-the-art and current simulators accurate to multiplicative error. Numerical…

从连续变量量子计算机的可模拟性到普适性

From simulatability to universality of continuous-variable quantum computers

本论文探讨了连续变量量子计算机相对于经典设备的计算优势边界，通过一系列证明展示了包括高度Wigner负性Gottesman-Kitaev-Preskill态在内的复杂电路仍可在多项式时间内经典模拟。

Anyon computers with smaller groups

Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons based on finite groups that are solvable but not nilpotent are capable of universal quantum computation. This extends previously published results to groups that are smaller, and therefore more practical. Additionally, a new universal gate-set is built out of an operation called a probabilistic projection, and a quasi-universal leakage correction scheme is dis…

Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state

What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model involving only projective measurements, quantum memory, and the ability to prepare the |0> state is also universal for quantum computation. In particular, no coherent unitary dynamics are involved in the computation.

Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer

Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on …

Universe as quantum computer

This paper shows that universal quantum computers possess decoherent histories in which complex adaptive systems evolve with high probability.

Benchmarking Supercomputers with the Jülich Universal Quantum Computer Simulator

We use a massively parallel simulator of a universal quantum computer to benchmark some of the most powerful supercomputers in the world. We find nearly ideal scaling behavior on the Sunway TaihuLight, the K computer, the IBM BlueGene/Q JUQUEEN, and the Intel Xeon based clusters JURECA and JUWELS. On the Sunway TaihuLight and the K computer, universal quantum computers with up to 48 qubits can be simulated by means of an adaptive two-byte encoding to reduce the memory requirements by a factor of eight. Additionally, we discuss an alternative approach to alleviate the memory bottleneck by decom…

Operation of universal gates in a DXD superconducting solid state quantum computer

We demonstrate that complete set of gates can be realized in a DXD superconducting solid state quantum computer (quamputer), thereby proving its universality.

Novel Scheme for Universal Quantum Computation

A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred hyperfine (superhyperfine) Fermi contact interaction. Operations illustrating entanglement, nonlocality, and quantum control logic operations are presented and discussed. The notion of universality of quantum computation is introduced and the irreducible conditions are presented. It is demonstrated that the proposed generic scenario for realization of a quantum c…

通用光子量子计算机编译器

A compiler for universal photonic quantum computers

本文提出一种将QASM电路转换为测量图（m-graph）并利用ZX-Calculus优化的编译器流水线，可直接映射到光学单向量子计算机硬件指令，并在实验光子平台上验证。研究解决了光子通用量子计算中电路到硬件执行的转换问题，主要贡献是建立了从电路到测量图的自动编译与优化框架。

在IBM量子计算机上对通用纠缠门进行全量子过程层析成像

Full Quantum Process Tomography of a Universal Entangling Gate on an IBM's Quantum Computer

本研究在IBM量子计算硬件上对通用两比特纠缠门SQSCZ开展全量子过程层析成像，验证了其良好的保真度与噪声特性，为量子计算的理论与应用发展提供支撑。

Universal quantum computing with superconducting charge qubits

Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit universal gate operations between arbitrary qubits, the multiple pairs of two-qubit gate operations in parallel, the coupling operations on a group of qubits in parallel, the coupling operations on multiple groups of qubits in parallel, the coupling operations on multiple pairs and multiple groups of qubits in parallel. Within available technology, a universa…

Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation

The Turaev-Viro invariants are scalar topological invariants of compact, orientable 3-manifolds. We give a quantum algorithm for additively approximating Turaev-Viro invariants of a manifold presented by a Heegaard splitting. The algorithm is motivated by the relationship between topological quantum computers and (2+1)-D topological quantum field theories. Its accuracy is shown to be nontrivial, as the same algorithm, after efficient classical preprocessing, can solve any problem efficiently decidable by a quantum computer. Thus approximating certain Turaev-Viro invariants of manifolds present…

Fault-tolerant error correction for a universal non-Abelian topological quantum computer at finite temperature

We study fault-tolerant error correction in a quantum memory constructed as a two-dimensional model of Fibonacci anyons on a torus, in the presence of thermal noise represented by pair-creation processes and measurement errors. The correction procedure is based on the cellular automaton decoders originating in the works of Gács and Harrington. Through numerical simulations, we observe that this code behaves fault-tolerantly and that threshold behavior is likely present. Hence, we provide strong evidence for the existence of a fault-tolerant universal non-Abelian topological quantum computer.

Universal Statistical Simulator

The Quantum Fourier Transform is a famous example in quantum computing for being the first demonstration of a useful algorithm in which a quantum computer is exponentially faster than a classical computer. However when giving an explanation of the speed up, understanding computational complexity of a classical calculation has to be taken on faith. Moreover, the explanation also comes with the caveat that the current classical calculations might be improved. In this paper we present a quantum computer code for a Galton Board Simulator that is exponentially faster than a classical calculation us…

Universal quantum computer from a quantum magnet

We show that a local Hamiltonian of spin-3/2 particles with only two-body nearest-neighbor Affleck-Kennedy-Lieb-Tasaki and exchange-type interactions has an unique ground state, which can be used to implement universal quantum computation merely with single-spin measurements. We prove that the Hamiltonian is gapped, independent of the system size. Our result provides a further step towards utilizing systems with condensed matter-type interactions for measurement-based quantum computation.

Nonlocality as a Benchmark for Universal Quantum Computation in Ising Anyon Topological Quantum Computers

An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set of operations (often called stabilizer operations) has been studied in quantum information theory, and it is known that no quantum-computational advantage can be obtained without the help of an additional non-stabilizer operation. Similarly, a bipartite two-qubit system based on Ising anyons cannot exhibit non-locality (in the sense of violating a Bell ineq…

Computational Model for the One-Way Quantum Computer: Concepts and Summary

The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is different from the quantum logic network model and it is based on different constituents. It has no quantum register and does not consist of quantum gates. The QCc is nevertheless quantum mechanical since it uses a highly entangled cluster state as the central physical resource. The scheme works by measuring quantum correlations of the universal cluster state.

Universal Uncertainty Principle in Different Quantum Theories

This paper deduces universal uncertainty principle in different quantum theories after about one century of proposing uncertainty principle by Heisenberg, i.e., new universal uncertainty principle of any orders of physical quantities in quantum physics, overcomes the difficulty that current quantum computer, quantum communication, quantum control, quantum mechanics and so on theories cannot give exact values of general uncertainty of any orders of physical quantities, further gives all relevant different expressions of the universal uncertainty principle and their applications. In fact, our st…

A relational quantum computer using only two-qubit total spin measurement and an initial supply of highly mixed single qubit states

We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different (potentially highly mixed) states. In some sense this measurement is a `more universal' dynamical element than a universal 2-qubit unitary gate, since the latter must be supplemented by measurement. Because of the rotational invariance of the measurement used, our scheme is robust to collective decoherence in a manner very different to previous proposals - in effe…

在通用量子计算机上预测RNA二级结构

Predicting RNA Secondary Structure on Universal Quantum Computer

本文提出首个基于门的通用量子算法，将RNA二级结构折叠映射为二次无约束二值优化模型并用QAOA求解，实验表明其在非嵌套序列上优于经典方法且具鲁棒性。

在通用量子计算机上模拟开放量子系统

Simulation of open quantum systems on universal quantum computers

提出用伴随密度矩阵将开放量子系统的非幺正动力学转化为可采样的混合幺正信道，并在耗散XY和无序Heisenberg模型中验证其可扩展性。

基于Cornucopia码的模块化量子计算机

A modular quantum computer based on Cornucopia codes

本文提出基于Cornucopia码的模块化量子计算机架构，通过可重复使用的组件实现通用逻辑操作，在低开销下保留超高码率量子存储器的资源优势，为低开销容错量子计算机提供了新路径。

Remarks on Universal Quantum Computer

According to Deutsch, a universal quantum Turing machine (UQTM) is able to perform, in repeating a fixed unitary transformation on the total system, an arbitrary unitary transformation on an arbitrary data state, by including a program as another part of the input state. We note that if such a UQTM really exists, with the program state dependent on the data state, and if the prescribed halting scheme is indeed valid, then there would be no entanglement between the halt qubit and other qubits, as pointed out by Myers. If, however, the program is required to be independent of the data, the conce…

Quantum computers as universal quantum simulators: state-of-art and perspectives

The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present review aims at giving a comprehensive outlook on the state of art capabilities offered from these near-term noisy devices as universal quantum simulators, i.e. programmable quantum computers potentially able to c…

Does it Make Sense to Speak of Self-Locating Uncertainty in the Universal Wave Function? Remarks on Sebens and Carroll

Following a proposal of Vaidman, Sebens and Carroll have argued that in Everettian (i.e. purely unitary) quantum theory, observers are uncertain, before they complete their observation, about which Everettian branch they are on. They argue further that this solves the problem of making sense of probabilities within Everettian quantum theory, even though the theory itself is deterministic. We note some problems with these arguments.

非厄米计算机不需要复数

Non-Hermitian Computers Need No Complex Numbers

本文研究非厄米量子计算中实门集${H, \text{CCNOT}, G}$的威力，证明其能在多项式时间内解决$\text{P}^{\sharp\text{P}}$问题，表明非酉性而非通用性是关键资源，且复数并非必要。

Realization of Universal Ion Trap Quantum Computation with Decoherence Free Qubits

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.

Decoherence, Control, and Symmetry in Quantum Computers

In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such co…

QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers

In this paper, we present QPack, a universal benchmark for Noisy Intermediate-Scale Quantum (NISQ) computers based on Quantum Approximate Optimization Algorithms (QAOA). Unlike other evaluation metrics in the field, this benchmark evaluates not only one, but multiple important aspects of quantum computing hardware: the maximum problem size a quantum computer can solve, the required runtime, as well as the achieved accuracy. The applications MaxCut, dominating set and traveling salesman are included to provide variation in resource requirements. This will allow for a diverse benchmark that prom…

Perspective: Toward large-scale fault-tolerant universal photonic quantum computing

Photonic quantum computing is one of the leading approaches to universal quantum computation. However, large-scale implementation of photonic quantum computing has been hindered by its intrinsic difficulties, such as probabilistic entangling gates for photonic qubits and lack of scalable ways to build photonic circuits. Here we discuss how to overcome these limitations by taking advantage of two key ideas which have recently emerged. One is a hybrid qubit-continuous variable approach for realizing a deterministic universal gate set for photonic qubits. The other is time-domain multiplexing tec…

在欧洲首个exascale超级计算机上实现50个量子比特的通用量子计算机模拟，利用其异构CPU-GPU架构

Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture

本文提出了一种新的高性能通用量子计算机模拟器JUQCS-50，利用GH200超级芯片的关键特性，在欧洲首个exascale超级计算机上实现了50个量子比特的通用量子计算机模拟，通过三个创新方法实现了16.6倍的速度提升。

量子计算机上的普适虚时临界动力学

Universal imaginary-time critical dynamics on a quantum computer

本文提出在量子计算机上利用虚时临界动力学和普适标度函数，在早期及浅线路深度下探测量子相变普适行为，并通过数值模拟与超导量子处理器实验验证了该方法的有效性。

Classical emulation of a quantum computer

This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g. acoustic, electromagnetic, etc.) but this paper will focus on electronic signals. Individual qubits are represented by in-phase and quadrature sinusoidal signals, while unitary gate operations are performed using simple analog electronic circuit devices. In this manner, the Hilbert space structure of a multi-qubit quantum state, as well as a universa…

Lattice Quantum Chromodynamics and Electrodynamics on a Universal Quantum Computer

It is widely anticipated that a large-scale quantum computer will offer an evermore accurate simulation of nature, opening the floodgates for exciting scientific breakthroughs and technological innovations. Here, we show a complete, instruction-by-instruction rubric to simulate U(1), SU(2), and SU(3) lattice gauge theories on a quantum computer. These theories describe quantum electrodynamics and chromodynamics, the key ingredients that form the fabric of our universe. We further provide a concrete estimate of the quantum computational resources required for an accurate simulation of lattice g…

The basic principles to construct a generalized state-locking pulse field and simulate efficiently the reversible and unitary halting protocol of a universal quantum computer

It has been shown (Arxiv: quant-ph/0507236) that a universal quantum computer could be powerful enough to solve efficiently the quantum search problem, and the reversible and unitary halting protocol based on the state-locking pulse field is the key component to construct the efficient quantum search processes, while the state-locking pulse field is the key component to generate the reversible and unitary halting protocol. In this paper the reversible and unitary halting protocol and the generalized state-locking pulse field have been extensively investigated theoretically. The basic principle…

Universal quantum computer based on Carbon Nanotube Rotators

We propose a universal quantum computer based on a chain of carbon nanotube rotators where one metallic plate is attached to each rotator. The dynamical variable is the rotational angle $ϕ$. The attached plate connected to ground electrostatically interacts with two fixed plates. Two angle positions $ϕ=0,π$ are made stable by applying a voltage difference between the attached plate and the two fixed plates. We assign $ϕ=0$ and $π$ to the qubit states $|0\rangle$ and $|1\rangle $. Then, considering a chain of rotators, we construct the arbitrary phase-shift gate, the NOT gate and the Ising gate…

The Optical Frequency Comb as a One-Way Quantum Computer

In the one-way model of quantum computing, quantum algorithms are implemented using only measurements on an entangled initial state. Much of the hard work is done up-front when creating this universal resource, known as a cluster state, on which the measurements are made. Here we detail a new proposal for a scalable method of creating cluster states using only a single multimode optical parametric oscillator (OPO). The method generates a continuous-variable cluster state that is universal for quantum computation and encoded in the quadratures of the optical frequency comb of the OPO. This work…

Universal quantum computation via quantum controlled classical operations

A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model …

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap-tests. Our formalism inherits the advantages that the quantum information is decoupled from collec…