相关论文: Does Quantum Mechanics allow for Infinite Parallel…
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…
Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have…
The claims made in a manifesto resulting in the European quantum technologies flagship initiative in quantum technology and similar enterprises are taken as starting point to critically review some potential quantum resources, such as…
This paper proposed a quantum analogue of classical queue automata by using the definition of the quantum Turing machine and quantum finite-state automata. However, quantum automata equipped with storage medium of a stack has been…
The classical and quantum features of Nambu mechanics are analyzed and fundamental issues are resolved. The classical theory is reviewed and developed utilizing varied examples. The quantum theory is discussed in a parallel presentation,…
The paper puts into discussion the concept of universality, in particular for structures not of the power of Turing computability. The question arises if for such structures a universal structure of the same kind exists or not. For that the…
The development of quantum algorithms and protocols calls for adequate modelling and verification techniques, which requires abstracting and focusing on the basic features of quantum concurrent systems, like CCS and CSP have done for their…
We bring together two topics (quantum mechanics and time passage) with the goal of clarifying questions about each. Specifically, we claim that the formalism of quantum mechanics provides an answer to the question: "What is time passage?".
Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs…
We present a brief non-technical introduction to the standing discussion on the relation between Quantum Mechanics and Determinism. Quantum Mechanics inherent randomness in the measurement process is sometimes presented as a door to explain…
Quantum computers are the promising candidates for simulation of large quantum systems, which is a daunting task to perform in a classical computer. Here, we report the experimental realization of quantum tunneling of a single particle…
Quantum hardware has the potential to efficiently solve computationally difficult problems in physics and chemistry to reap enormous practical rewards. Analogue quantum simulation accomplishes this by using the dynamics of a controlled…
We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, the kind of computation that exceeds the Turing computability,…
We review a possible framework for (non)linear quantum theories, into which linear quantum mechanics fits as well, and discuss the notion of ``equivalence'' in this setting. Finally, we draw the attention to persisting severe problems of…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
Two questions are suggested as having priority when trying to bring together Quantum Mechanics and General Relativity. Both questions have a scope which goes well beyond Physics, and in particular Quantum Mechanics and General Relativity.
This research paper gives an overview of quantum computers - description of their operation, differences between quantum and silicon computers, major construction problems of a quantum computer and many other basic aspects. No special…
This paper describes a type of infinitary computer (a hypercomputer) capable of computing truth in initial levels of the set theoretic universe, V. The proper class of such hypercomputers is called a universal hypercomputer. There are two…
From the philosopher's perspective, the interest in quantum computation stems primarily from the way that it combines fundamental concepts from two distinct sciences: physics (especially quantum mechanics) and computer science, each long a…
We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed…