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

Kluwer Academic Publishers eBooks

A New Approach to Quantum Computation

Horace P. Yuen

Published Dec 19, 2005• 3 citations
Publisher

Abstract

A general quantum machine is characterized to capture all the possible physical structures that may be employed for effective or efficient computation. As an illustration, a specific machine is described for the permanent evaluation problem. The contrast between quantum and classical parallelism is also discussed, as is the effect of quantum error correction against decoherence and loss. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI
10.1007/0-306-47097-7_33

Related papers

Quantum Algorithms

A. O. Pittenger

We are now ready to assemble quantum subroutines into quantum algorithms. A reasonable first question is: Are there problems which can be solved efficiently on a quantum computer? In his analysis of a universal quantum computer [25], Deutsch illustrated quantum parallelism by constructing a procedure to compute the parity f (0) ⊕ f (1) of a function on one bit. In a generalization of this context, Deutsch and Jozsa [27] defined a quantum algorithm that could solve a problem more efficiently than is possible on a classical computer. This problem helped motivate the search for algorithms that could solve “real” problems, and Simon [67] provided an example that inspired Shor’s subsequent work on the factoring problem and on the discrete logarithm problem. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Boston eBooks•Jan 1, 2001•0 citations

Approaches to Quantum Error Correction

Julia Kempe

In a ground breaking discovery in 1994, Shor has shown that quantum computers, if built, can factor numbers efficiently. Since then quantum computing has become a burgeoning field of research, attracting theoreticians and experimentalists alike, and regrouping researchers from fields like computer science, physics, mathematics and engineering. Quantum information is very fragile and prone to decoherence. Yet by the middle of 1996 it has been shown that fault-tolerant quantum computation is possible. We give a simple description of the elements of quantum error-correction and quantum fault-tolerance. After characterizing quantum errors we present several error correction schemes and outline the elements of a full fledged fault-tolerant computation, which works error-free even though all of its components can be faulty. We also mention alternative approaches to error-correction, so called error-avoiding or decoherence-free schemes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

arXiv:quant-ph/0612185•Birkhäuser Basel eBooks•Jan 1, 2006•57 citations

WHAT IS QUANTUM COMPUTATION?

ARTUR K. EKERT, Patrick M. Hayden, Hitoshi Inamori +1 more

"Information is physical and any processing of information is always performed by physical means," an innocent-sounding statement, but its consequences are profound. When quantum effects become important, for example, at the level of single atoms and photons, the classical theory of computation becomes fundamentally inadequate. Entirely new modes of computation and information processing become possible. In the last few years there has been an explosion of theoretical and experimental research in quantum computation. In this brief review we describe some of these developments.

•May 1, 2001•16 citations

Quantum Hardware

Yorick Hardy, Willi-Hans Steeb

Computation is ultimately a physical process. In practice, the range of physically realizable devices determines what is computable and the resources, such as computer time, required to solve a given problem. Computing machines can exploit a variety of physical processes and structures to provide distinct trade-offs in resource requirements. An example is the development of parallel computers with their trade-off of overall computation time against the number of processors employed. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooks•Jan 1, 2001•0 citations

WHAT IS QUANTUM COMPUTATION?

ARTUR K. EKERT, Patrick M. Hayden, Hitoshi Inamori +1 more

"Information is physical and any processing of information is always performed by physical means," an innocent-sounding statement, but its consequences are profound. When quantum effects become important, for example, at the level of single atoms and photons, the classical theory of computation becomes fundamentally inadequate. Entirely new modes of computation and information processing become possible. In the last few years there has been an explosion of theoretical and experimental research in quantum computation. In this brief review we describe some of these developments.

International Journal of Modern Physics A•Aug 10, 2001•12 citations

Chapter 1: Model of computation

Giacomo Nannicini

Quantum computing is a relatively new field of computing that has the potential to greatly speed up the solution of certain problems. This book is about quantum algorithms, with a focus on algorithms that may be useful for mathematical optimization. Quantum computers work in a way that is fundamentally different from classical computers. We begin by introducing the model of computation, and then proceed to study several quantum algorithms. In the following, the term “classical” is used to mean “nonquantum,” as is common in the field.

Society for Industrial and Applied Mathematics eBooks•Dec 17, 2025•0 citations
A general quantum machine is characterized to capture all the possible physical structures that may be employed for effective or efficient computation. As an illustration, a specific machine is described for the permanent evaluation problem. The contrast between quantum and classical parallelism is also discussed, as is the effect of quantum error correction against decoherence and loss. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
We are now ready to assemble quantum subroutines into quantum algorithms. A reasonable first question is: Are there problems which can be solved efficiently on a quantum computer? In his analysis of a universal quantum computer [25], Deutsch illustrated quantum parallelism by constructing a procedure to compute the parity f (0) ⊕ f (1) of a function on one bit. In a generalization of this context, Deutsch and Jozsa [27] defined a quantum algorithm that could solve a problem more efficiently than is possible on a classical computer. This problem helped motivate the search for algorithms that could solve “real” problems, and Simon [67] provided an example that inspired Shor’s subsequent work on the factoring problem and on the discrete logarithm problem. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
In a ground breaking discovery in 1994, Shor has shown that quantum computers, if built, can factor numbers efficiently. Since then quantum computing has become a burgeoning field of research, attracting theoreticians and experimentalists alike, and regrouping researchers from fields like computer science, physics, mathematics and engineering. Quantum information is very fragile and prone to decoherence. Yet by the middle of 1996 it has been shown that fault-tolerant quantum computation is possible. We give a simple description of the elements of quantum error-correction and quantum fault-tolerance. After characterizing quantum errors we present several error correction schemes and outline the elements of a full fledged fault-tolerant computation, which works error-free even though all of its components can be faulty. We also mention alternative approaches to error-correction, so called error-avoiding or decoherence-free schemes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
"Information is physical and any processing of information is always performed by physical means," an innocent-sounding statement, but its consequences are profound. When quantum effects become important, for example, at the level of single atoms and photons, the classical theory of computation becomes fundamentally inadequate. Entirely new modes of computation and information processing become possible. In the last few years there has been an explosion of theoretical and experimental research in quantum computation. In this brief review we describe some of these developments.
Computation is ultimately a physical process. In practice, the range of physically realizable devices determines what is computable and the resources, such as computer time, required to solve a given problem. Computing machines can exploit a variety of physical processes and structures to provide distinct trade-offs in resource requirements. An example is the development of parallel computers with their trade-off of overall computation time against the number of processors employed. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
"Information is physical and any processing of information is always performed by physical means," an innocent-sounding statement, but its consequences are profound. When quantum effects become important, for example, at the level of single atoms and photons, the classical theory of computation becomes fundamentally inadequate. Entirely new modes of computation and information processing become possible. In the last few years there has been an explosion of theoretical and experimental research in quantum computation. In this brief review we describe some of these developments.
Quantum computing is a relatively new field of computing that has the potential to greatly speed up the solution of certain problems. This book is about quantum algorithms, with a focus on algorithms that may be useful for mathematical optimization. Quantum computers work in a way that is fundamentally different from classical computers. We begin by introducing the model of computation, and then proceed to study several quantum algorithms. In the following, the term “classical” is used to mean “nonquantum,” as is common in the field.