Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0003151

Unconventional Quantum Computing Devices

Seth Lloyd

Published Mar 31, 2000• 6 citations
arXivHTMLPDF

Abstract

This paper investigates a variety of unconventional quantum computation devices, including fermionic quantum computers and computers that exploit nonlinear quantum mechanics. It is shown that unconventional quantum computing devices can in principle compute some quantities more rapidly than `conventional' quantum computers.
DOI
10.48550/arxiv.quant-ph/0003151

Related papers

Quantum computing: beyond the limits of conventional computation†

Marius Nagy, Selim G. Akl

The quantum model of computation not only offers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum mechanical terms. We show that the task of distinguishing among entangled quantum states combines entanglement and non-determinism in a way that makes the quantum solution impossible to simulate on any classical machine (even one equipped with the same measurement capabilities as the quantum computational device). A new class of information processing tasks is thus uncovered whose members are readily carried out by a quantum computer, yet are impossible to perform on any classical machine (whether deterministic or probabilistic). In the broad, unconventional context created by quantum mechanics, the computational power of a quantum computer is therefore strictly greater than that of a classical computer.

International Journal of Parallel Emergent and Distributed Systems•Mar 30, 2007•22 citations

Quantum computing

Harry Paul

Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.

Cambridge University Press eBooks•Jun 5, 2008•0 citations

Principles of quantum computing

David Peter Divincenzo

It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.

Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference•Nov 19, 2002•7 citations

Quantum Computing

Anupama Chadha, Sachin Kumar Sharma, Rahul Chaudhary +2 more

In this chapter, we discuss about how quantum computers are different from classical computers and their advantages over classical computers. We also discuss some hypotheses regarding how a quantum computer works.

Apple Academic Press eBooks•Nov 9, 2023•0 citations

[The NMR implementation of quantum algorithm].

Xuemei Luo

A quantum computer is a device that processes information in a quantum-mechanically coherent fashion. In principle, it can exploit coherent quantum interference and entanglement to perform computations, such as factoring large numbers or searching an unsorted database, more rapidly than classical computers. Noise, decoherence, and manufacturing problems make constructing large scale quantum computers difficult. Ion traps and optical cavities offer promising experimental approaches, but no quantum algorithm has yet been implemented with those systems. On the other hand, because of their natural isolation from the environment, nuclear spins are particularly good 'quantum bits', and their use for quantum computation is possible by applying nuclear magnetic resonance (NMR) techniques in an unconventional manner. Here, we report on the experimental implementation of a quantum algorithm using NMR to solve a purely mathematical problem in fewer steps than is possible classically. Our simple quantum computer can determine the type of an unknown function using fewer function 'calls' than is possible using a classical computer.

•Feb 1, 2003•0 citations

The art of quantum computing

Miya Knights

This paper presents a different kind of computer that will exploit the peculiarities of the quantum world to accomplish number-crunching feats that are currently impossible. The principles by which a quantum computer would work are quite different from those governing today's classical computers. Despite current processor and memory designs already having to take quantum mechanical effects into account, quantum computing is something far stranger.

Engineering & Technology•Jan 1, 2007•5 citations
The quantum model of computation not only offers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum mechanical terms. We show that the task of distinguishing among entangled quantum states combines entanglement and non-determinism in a way that makes the quantum solution impossible to simulate on any classical machine (even one equipped with the same measurement capabilities as the quantum computational device). A new class of information processing tasks is thus uncovered whose members are readily carried out by a quantum computer, yet are impossible to perform on any classical machine (whether deterministic or probabilistic). In the broad, unconventional context created by quantum mechanics, the computational power of a quantum computer is therefore strictly greater than that of a classical computer.
Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.
It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.
A quantum computer is a device that processes information in a quantum-mechanically coherent fashion. In principle, it can exploit coherent quantum interference and entanglement to perform computations, such as factoring large numbers or searching an unsorted database, more rapidly than classical computers. Noise, decoherence, and manufacturing problems make constructing large scale quantum computers difficult. Ion traps and optical cavities offer promising experimental approaches, but no quantum algorithm has yet been implemented with those systems. On the other hand, because of their natural isolation from the environment, nuclear spins are particularly good 'quantum bits', and their use for quantum computation is possible by applying nuclear magnetic resonance (NMR) techniques in an unconventional manner. Here, we report on the experimental implementation of a quantum algorithm using NMR to solve a purely mathematical problem in fewer steps than is possible classically. Our simple quantum computer can determine the type of an unknown function using fewer function 'calls' than is possible using a classical computer.