相关论文: The halting problem for universal quantum computer…

The problem of the quantitative degradation of the performance of a quantum computer due to noisy unitary gates (imperfect external control) is studied. It is shown that quite general conclusions on the evolution of the fidelity can be…

What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model…

Photonic quantum computing is one of the leading approaches to universal quantum computation. However, large-scale implementation of photonic quantum computing has been hindered by its intrinsic difficulties, such as probabilistic…

We point out a fundamental problem that hinders the quantization of general relativity: quantum mechanics is formulated in terms of systems, typically limited in space but infinitely extended in time, while general relativity is formulated…

It is shown in the paper that the unitary quantum dynamics in quantum mechanics is the universal quantum driving force to speed up a quantum computation. This assertion supports strongly in theory that the unitary quantum dynamics is the…

The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…

A conjecture for the universal constraints for relaxation rates of a quantum dynamical semigroup is proposed. It is shown that it holds for several interesting classes of semigroups, e.g. unital semigroups and semigroups derived in the weak…

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…

We investigate if physical laws can impose limit on computational time and speed of a quantum computer built from elementary particles. We show that the product of the speed and the running time of a quantum computer is limited by the type…

Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications…

Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can…

We study effects of the physical realization of quantum computers on their logical operation. Through simulation of physical models of quantum computer hardware, we analyze the difficulties that are encountered in programming physical…

I argue that the many worlds explanation of quantum computation is not licensed by, and in fact is conceptually inferior to, the many worlds interpretation of quantum mechanics from which it is derived. I argue that the many worlds…

The problem of initializing phase in a quantum computing system is considered. The initialization of phases is a problem when the system is initially present in an entangled state and also in the application of the quantum gate…

A legend tells that once Loschmidt asked Boltzmann on what happens to his statistical theory if one inverts the velocities of all particles, so that, due to the reversibility of Newton's equations, they return from the equilibrium to a…

In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…

This article focuses on the connection between the possibility of quantum computers, the predictability of complex quantum systems in nature, and the issue of free will.

The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…

The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of…