Top Research Papers on Quantum Computing

It turns out that it is very difficult to characterize the power of quantum computers, and while the quantum algorithm for factoring performs exponentially faster than the best available classical algorithm, it is extremely hard to prove this for every possible classical algorithm.

The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented and methods for correcting quantum computing errors arising from the decoherence of the state of the quantum computer are considered.

Where a classical computer obeys the well understood laws of classical physics, a quantum computer is a device that harnesses physical phenomenon unique to quantum mechanics to realize a fundamentally new mode of information processing.

An introduction to the basic concept of quantum computation and quantum computer is presented, the advantages of quantum computer over the classical ones are analyzed and some proposed methods of realization and application of the quantum computer are discussed.

This overview provides an introductory perspective on a selection of current trends in quantum thermodynamics and their impact on quantum computers and quantum computing, with language that is accessible to postgraduate students and researchers from different fields.

The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems and paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

The core and primary focus of this thesis is the theoretical construction of a machine that can compute every computable function, that is, a universal (i.e.programmable) quantum computer.

A delayed commutation switch is proposed that can solve the problem of switching time in packet switching networks with the help of some local ancillary qubits and superdense codes.

It is shown that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form.

The purpose of this article is to provide a comprehensive overview about the deep involvement of quantum theory in quantum computation to young researchers and newcomers in the field.

This chapter explores some of the guiding principles and model systems for physical implementation of quantum information processing devices and systems and briefly describes the physical apparatus, the Hamiltonian, means for controlling the system to perform quantum computation, and its principal drawbacks.

An overview of the current beliefs of quantum complexity theorists is presented and the impacts these beliefs may have on the future of the field are discussed, including the actual practical gains that might be realized by quantum computation.

This work explicitly construct quantum circuits for Majorana braiding and run them on IBM quantum computers to prepare the ground states of strongly correlated Kitaev-inspired models, and shows how maintaining particle-hole symmetry is critical to carrying out this work.

This paper provides an introduction to quantum computing, quantum mechanical phenomena used in quantum computing and quantum computing.

Shanghai University (SHU) and Huawei company, Fangrunhua Lecture Hall, Baoshan Campus, Shanghai University, from 21 - 22 September, 2019.

The architecture of classical computers does not make use of one of the most fundamental features of quantum mechanics, namely the possibi lity of superpositions, so classical and quantum computers could in principle emulate each other and quantum computing are thus no hypercomputers.

This appendix is going to provide the basic guidelines for “playing the quantum computing game” with the help of the MATLAB environment.

This work presents the basic ideas of the quantum algorithm for the solution of Schrodinger´s equation and the estimation of the resources needed for a quantum computer to achieve this task.

A representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars, and an algebraic approach to high level Quantum Languages is developed using Quantum Assembly language and Quantum C language as examples.

It is proved the interval of a non-commutative quasi l-group with a strong quasi-unit is a quasipseudo-MV algebra and the direct product decomposition of these algebras is investigated.

The analysis demonstrates that quantum communication technology can considerably reduce the processing delay time and build faster and more efficient packet-switched networks.

This project extends the usual perfect simulations by also considering the architectural constraints and noise of a particular physical implementation of a quantum computer implementation, to provide a general framework for constructing experimentally realistic simulations.

It is indicated that principal models of computation are indeed significantly related. The quantum field computation model contains the quantum computation model of Feynman. (The term "quantum field computer" was used by Freedman.) Quantum field computation (as enhanced by Wightman's model of quantum field theory) involves computation over the continuum which is remarkably related to the real computation model of Smale. The latter model was established as a generalization of Turing computation. All this is not surprising since it is well known that the physics of quantum field theory (which in...

The fundamental ideas and methods of quantum computing—including quantum gates, quantum circuits, and quantum algorithms—as they relate to machine learning are examined in this abstract.

A two- server protocol is proposed for oblivious quantum computation, which realizes an exponential improvement for the communication complexity over the simple application of two-server (quantum) oblivious transfer to the sending of the computation result.

The concepts of deterministic state machine, classical probabilistic state machine and quantum state machine are introduced to discuss the question: to what extent can quantum state machines be simulated by classical probablistic state machines.

This work investigates the notion of Shi–Aharonov quantum computational algebra, which plays the role for quantum computation that is played by σ-complete Boolean algebras in classical probability theory.

A new unified theoretical framework that describes the full dynamics of quantum computation, and shows that the seemingly different circuit, graph- (including cluster-) state, and adiabatic paradigms for quantum computing are in fact all manifestations of a single, universal paradigm for all physical quantum computation.

This chapter outlines the modern theory of algorithms developed by computer science, and focuses on the fundamental model for algorithms, the Turing machine, which is an idealized computer, rather like a modern personal computer, but with a simpler set of basic instructions, and an idealization unbounded memory.

A theory of quantum gravity based on quantum computation is proposed, which differs from conventional approaches to quantum gravity such as string theory, canonical quantization, loop quantum gravity, and Euclidean quantum gravity in that it does not set out to quantize gravity directly.

The door of quantum mechanics is opened, the basic concepts and tools of the trade are introduced, and the crucial notion of entanglement is met, a feature of the quantum world that pops up again in the chapters ahead.

The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown, so this result implies that the adiABatic computation model and the standard quantum circuit model are polynomially equivalent.

Last chapter, we talked about whether quantum states should be thought of as exponentially long vectors, and I brought up class BQP/qpoly and concepts like quantum advice. Actually, I’d say that the main reason why I care is something I didn't mention last time, which is that it relates to whether we should expect quantum computing to be fundamentally possible or not. There are people, like Leonid Levin and Oded Goldreich, who just take it as obvious that quantum computing must be impossible. Part of their argument is that it's extravagant to imagine a world where describing the state of 200 p...

This paper focuses on the simulation of certain quantum algorithms such as the prisoner's dilemma in its quantum version using the MATHEMATICA® software and implementing stochastic version of the software MAPLE ® and the Grover search algorithm that simulates finding a needle in a haystack.

This paper gives a protocol for the blindness by using a quantum one-time pad encryption and T-like gate, and for verifying computation by using trap qubits.

A basic problem in QFT is identified, namely Wightman’s computation problem for domains of holomorphy, which is inspired by the same analytic functions which are central to the famous CPT theorem of QFT, and it is possible to obtain a computational complexity structure for QFT and shed new light on certain complexity classes.

In this mode, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani and the Cleve-DiVincenzo algorithms can be reutilized and makes a fuller use of qubit resources in an ensemble quantum computer.

A survey of all the important aspects and results that have shaped the field of quantum computation and quantum information and their applications to the general theory of information, cryptography, algorithms, computational complexity and error-correction.

This article looks at the postulates of quantum mechanics, a mathematical theory currently being developed to give a theoretical basis for building a "quantum computer," which is claimed to be faster than any classical computer to date.

We propose an implementation of a universal set of one- and two-quantum-bit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier between neighboring dots. Several measures of the gate quality are computed within a recently derived spin master equation incorporating decoherence caused by a prototypical magnetic environment. Dot-array experiments that would provide an initial demonstration of the desired nonequilibrium spin dynamics are proposed.

A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with different environments.

We present a general scheme for performing a simulation of the dynamics of one quantum system using another. This scheme is used to experimentally simulate the dynamics of truncated quantum harmonic and anharmonic oscillators using nuclear magnetic resonance. We believe this to be the first explicit physical realization of such a simulation. {copyright} {ital 1999} {ital The American Physical Society }

The paper attempts to explain how the result of quantum mechanics is the natural obstacle to the existing computer technology--10 10 m is the limit of the integration of the fuse slice.

The measurement problem which is one of the controversial problems of quantum mechanics is presented, the collapse theory and the no-collapse theory are illustrated respectively and the rationality of the two theories is stated by drawing a comparison between them.

A quantum algorithm that has a query complexity O(n(logn) √ k) is proposed, which shows speed-up comparing with the deterministic algorithm (radix sort) that requires Ω((n+ d)k) queries, where d is a size of the alphabet.

It is demonstrated how quantum field theory problems can be embedded on quantum annealers by a discretisation of the field theory problem into a general Ising model, with the continuous field values being encoded into Ising spin chains.

Recent developments in quantum computation and quantum simulation are reviewed to include quantum simulation of many-body system, quantum computation, digital quantum simulators and cloud quantum computation platforms, and quantum software.

This chapter presents state-of-the-art and future perspectives of quantum computing and communication from current implementations of quantum computers and principles of quantum programming.

The encoding of memristive quantum dynamics on a digital quantum computer using a set of auxiliary qubits is proposed, and this method is extended to the case of two coupled quantum memristors, opening the door to the study of neuromorphic quantum computing in the NISQ era.

This paper introduces the basic concepts of quantum computation and quantum simulation and presents quantum algorithms that are known to be much faster than the available classic algorithms and provides a statistical framework for the analysis of quantum algorithms and quantum Simulation.