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

The New Scientist

Don't fear the f-word

Published Jan 1, 2011• 0 citations
Publisher
DOI
10.1016/s0262-4079(11)60113-9

Related papers

Don't panic

Margaret Harris

Physics World•Jun 1, 2009•0 citations

Show, don't tell

Yi-Kai Liu

Nature Physics•Jul 27, 2014•0 citations

Don't bet on it

Physics World•Jan 1, 2010•0 citations

The Early Years—When Einstein Attacks! 5

Certain Uncertainties

A common theme of this book is that quantum computers are much dierent than classical computers (such as your personal computer), because they require quantum mechanics for their working (and classical computers do not). To understand just how dierent a quantum computer is from a classical © 2010 Taylor & Francis Group, LLC computer, it is necessary to understand just how dierent quantum mechanics is from classical mechanics. I could just tell you they are dierent and get right to work on the story of the quantum computer, but then you would just have to take my word for this dierence. However, I don’t want you to just take my word for it. I don’t want you to just believe quantum mechanics is dierent than classical mechanics; I want you to know it. So my goal in this chapter is to show you that the quantum theory of Bohr and Heisenberg and Schrödinger is really dierent (and much stranger) from the classical theory of Kepler and Newton and Maxwell.

CRC Press eBooks•Apr 8, 2013•0 citations

Beating the code breakers

ARTUR K. EKERT

Nature•Jul 1, 1992•53 citations

The Deutsch-Josza algorithm for n-qudits

Gabriela Mogos

Abstract: Over the last decade has been a lot of interest in new types of computable machines, due partly over the fears on conventional, classical, computing. Research by leading physicists, mathematicians and computer scientists has shown quantum computers could be the future, as they may be able to solve some computationally difficult problems much faster than is currently possible on a classical computer. David Deutsch has already created a working model for a quantum computer, the quantum Turing machine or QTM Deutsch [1985]. This has been proved as a model for computation on a quantum and has allowed algorithms to be developed. Deutsch-Josza’s algorithm, as all known quantum algorithms that provide exponential speedup over classical systems do, answers a question about a global property of a solution space. This paper describes the generalization of the Deutsch-Josza algorithm to n d-dimensional quantum systems or qudits. Key–Words: quantum computing, quantum dits, quantum algorithm 1

•Nov 21, 2007•2 citations
A common theme of this book is that quantum computers are much dierent than classical computers (such as your personal computer), because they require quantum mechanics for their working (and classical computers do not). To understand just how dierent a quantum computer is from a classical © 2010 Taylor & Francis Group, LLC computer, it is necessary to understand just how dierent quantum mechanics is from classical mechanics. I could just tell you they are dierent and get right to work on the story of the quantum computer, but then you would just have to take my word for this dierence. However, I don’t want you to just take my word for it. I don’t want you to just believe quantum mechanics is dierent than classical mechanics; I want you to know it. So my goal in this chapter is to show you that the quantum theory of Bohr and Heisenberg and Schrödinger is really dierent (and much stranger) from the classical theory of Kepler and Newton and Maxwell.
Abstract: Over the last decade has been a lot of interest in new types of computable machines, due partly over the fears on conventional, classical, computing. Research by leading physicists, mathematicians and computer scientists has shown quantum computers could be the future, as they may be able to solve some computationally difficult problems much faster than is currently possible on a classical computer. David Deutsch has already created a working model for a quantum computer, the quantum Turing machine or QTM Deutsch [1985]. This has been proved as a model for computation on a quantum and has allowed algorithms to be developed. Deutsch-Josza’s algorithm, as all known quantum algorithms that provide exponential speedup over classical systems do, answers a question about a global property of a solution space. This paper describes the generalization of the Deutsch-Josza algorithm to n d-dimensional quantum systems or qudits. Key–Words: quantum computing, quantum dits, quantum algorithm 1