Related papers: Parallelism of quantum computations from prequantu…
Today, people are looking forward to get an awesome computational power. This kind of desire can be answered by quantum computing. By adopting quantum mechanics theory, it can generate a very fast computation result. As known, quantum…
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…
It is shown that a quantum controlled-NOT gate simultaneously performs the logical functions of three distinct conditional local operations. Each of these local operations can be verified by measuring a corresponding truth table of four…
Inspired by the extraordinary computing power promised by quantum computers, the quantum mind hypothesis postulated that quantum mechanical phenomena are the source of neuronal synchronization, which, in turn, might underlie consciousness.…
Ray tracing algorithm is a category of rendering algorithms that calculate the color of pixels by simulating the physical movements of a huge amount of rays and calculating their energies, which can be implemented in parallel. Meanwhile,…
qPCF is a paradigmatic quantum programming language that ex- tends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be duplicated and manipulated in flexible ways by means of a…
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…
Quantum particles and classical particles are described in a common setting of classical statistical physics. The property of a particle being "classical" or "quantum" ceases to be a basic conceptual difference. The dynamics differs,…
Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of `standard' Quantum Computers. These approaches rely on and indicate that Quantum…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
Quantum computing exhibits the unique capability to natively and efficiently encode various natural phenomena, promising theoretical speedups of several orders of magnitude. However, not all computational tasks can be efficiently executed…
Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrable functionality, and it is expected that scaling up to…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
The original motivation to build a quantum computer came from Feynman who envisaged a machine capable of simulating generic quantum mechanical systems, a task that is believed to be intractable for classical computers. Such a machine would…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important theoretical model for quantum computing. By exploiting the quantum…
A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically…
Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum…