Results 1  10
of
3,119,968
Quantum onetime programs (extended abstract)
"... Abstract. A onetime program is a hypothetical device by which a user may evaluate a circuit on exactly one input of his choice, before the device selfdestructs. Onetime programs cannot be achieved by software alone, as any software can be copied and rerun. However, it is known that every circuit ..."
Abstract
 Add to MetaCart
circuit can be compiled into a onetime program using a very basic hypothetical hardware device called a onetime memory. At first glance it may seem that quantum information, which cannot be copied, might also allow for onetime programs. But it is not hard to see that this intuition is false: onetime
Quantum onetime programs (short abstract for QCRYPT 2013) ∗
, 2013
"... A onetime program is a hypothetical device by which a user may evaluate a circuit on exactly one input of his choice, before the device selfdestructs. Onetime programs cannot be achieved by software alone, as any software can be copied and rerun. However, it is known that every circuit can be co ..."
Abstract
 Add to MetaCart
be compiled into a onetime program using a very basic hypothetical hardware device called a onetime memory. At first glance it may seem that quantum information, which cannot be copied, might also allow for onetime programs. But it is not hard to see that this intuition is false: onetime programs
Quantum Gravity
, 2004
"... We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theor ..."
Abstract

Cited by 566 (11 self)
 Add to MetaCart
We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string
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 increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract

Cited by 1103 (7 self)
 Add to MetaCart
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 increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken
Onetime programs
 In Advances in Cryptology – CRYPTO ’08
, 2008
"... Abstract. In this work, we introduce onetime programs, a new computational paradigm geared towards security applications. A onetime program can be executed on a single input, whose value can be specified at run time. Other than the result of the computation on this input, nothing else about the pr ..."
Abstract

Cited by 53 (8 self)
 Add to MetaCart
Abstract. In this work, we introduce onetime programs, a new computational paradigm geared towards security applications. A onetime program can be executed on a single input, whose value can be specified at run time. Other than the result of the computation on this input, nothing else about
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 582 (5 self)
 Add to MetaCart
to be specified. We prove that O(log T) bits of precision suffice to support a T step computation. This justifies the claim that the quantum Turing machine model should be regarded as a discrete model of computation and not an analog one. We give the first formal evidence that quantum Turing machines violate
Genetic Programming
, 1997
"... Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract

Cited by 1051 (12 self)
 Add to MetaCart
Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring
Literate programming
 THE COMPUTER JOURNAL
, 1984
"... The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones. ..."
Abstract

Cited by 549 (3 self)
 Add to MetaCart
The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones.
Results 1  10
of
3,119,968