Results 1  10
of
45
On an argument of David Deutsch
, 2003
"... We analyse an argument of Deutsch, which purports to show that the deterministic part of classical quantum theory together with deterministic axioms of classical decision theory, together imply that a rational decision maker behaves as if the probabilistic part of quantum theory (Born’s law) is true ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We analyse an argument of Deutsch, which purports to show that the deterministic part of classical quantum theory together with deterministic axioms of classical decision theory, together imply that a rational decision maker behaves as if the probabilistic part of quantum theory (Born’s law
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract

Cited by 1111 (5 self)
 Add to MetaCart
into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number
The DeutschJosza algorithm for nqudits
"... 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 ..."
Abstract
 Add to MetaCart
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
The Quantum Challenge to Structural Complexity Theory
, 1992
"... This is a nontechnical survey paper of recent quantummechanical discoveries that challenge generally accepted complexitytheoretic versions of the ChurchTuring thesis. In particular, building on pionering work of David Deutsch and Richard Jozsa, we construct an oracle relative to which there exi ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
This is a nontechnical survey paper of recent quantummechanical discoveries that challenge generally accepted complexitytheoretic versions of the ChurchTuring thesis. In particular, building on pionering work of David Deutsch and Richard Jozsa, we construct an oracle relative to which
containing Notes on Shor's Efficient Algorithm for Factoring on a Quantum Computer
, 1994
"... INTRODUCTION These notes are intended to be a selfcontained exposition of Shor's polynomialtime algorithm for factoring on a quantum computer, including some background in number theory and quantum computation. Thanks to David Deutsch and Umesh Vazirani for discussions and clarification of ma ..."
Abstract
 Add to MetaCart
INTRODUCTION These notes are intended to be a selfcontained exposition of Shor's polynomialtime algorithm for factoring on a quantum computer, including some background in number theory and quantum computation. Thanks to David Deutsch and Umesh Vazirani for discussions and clarification
A Note on Deutsch’s “Quantum Theory of Probability and Decisions”
, 1999
"... ABSTRACT: David Deutsch has a forthcoming article called “Quantum Theory of Probability and Decisions " in which he claims to derive the standard probabilistic interpretation of the wavefunction from nonprobabilistic considerations. In this note, I try to develop his argument in a classical co ..."
Abstract
 Add to MetaCart
ABSTRACT: David Deutsch has a forthcoming article called “Quantum Theory of Probability and Decisions " in which he claims to derive the standard probabilistic interpretation of the wavefunction from nonprobabilistic considerations. In this note, I try to develop his argument in a classical
Measurement Outcomes and Probability in Everettian Quantum Mechanics
, 2006
"... The decisiontheoretic account of probability in the Everett or manyworlds interpretation, advanced by David Deutsch and David Wallace, is shown to be circular. Talk of probability in Everett presumes the existence of a preferred basis to identify measurement outcomes for the probabilities to range ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
The decisiontheoretic account of probability in the Everett or manyworlds interpretation, advanced by David Deutsch and David Wallace, is shown to be circular. Talk of probability in Everett presumes the existence of a preferred basis to identify measurement outcomes for the probabilities
Ghost spinors in quantum particles interference
 Mathematical Structures and Modeling. 2002. No.9
"... In this article a question of the ghost spinors influence to the quantum particles interference is investigated. The interaction between spinors and ghost spinors are considered. Furthermore the conditions of zeropoint energymomentum tensor in private cases are found. Also we consider a question a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
about the In this article we consider some development of Deutsch idea [2]. David Deutsch consider the known experiment of quantum mechanics, namely the experiment with a quantum particles interference, and then the received interference pattern is explained by shadow particles existence
A formal proof of the Born rule from decisiontheoretic assumptions
, 2009
"... I develop the decisiontheoretic approach to quantum probability, originally proposed by David Deutsch, into a mathematically rigorous proof of the Born rule in (Everettinterpreted) quantum mechanics. I sketch the argument informally, then prove it formally, and lastly consider a number of proposed ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
I develop the decisiontheoretic approach to quantum probability, originally proposed by David Deutsch, into a mathematically rigorous proof of the Born rule in (Everettinterpreted) quantum mechanics. I sketch the argument informally, then prove it formally, and lastly consider a number
Rutgers University
"... The Everett (manyworlds) interpretation of quantum mechanics faces a prima facie problem concerning quantum probabilities. Research in this area has been fastpaced over the last few years, following a controversial suggestion by David Deutsch that decision theory can solve the problem. This articl ..."
Abstract
 Add to MetaCart
The Everett (manyworlds) interpretation of quantum mechanics faces a prima facie problem concerning quantum probabilities. Research in this area has been fastpaced over the last few years, following a controversial suggestion by David Deutsch that decision theory can solve the problem
Results 1  10
of
45