Related papers: Closed Timelike Curves Make Quantum and Classical …
This work deals with the analysis of cylindrically symmetric and stationary space-times $\mathcal{C}_{t}$ with closed timelike curves. The equation of motion describing the evolution of a massive scalar field in a $\mathcal{C}_{t}$…
In order to establish the computational equivalence between quantum Turing machines (QTMs) and quantum circuit families (QCFs) using Yao's quantum circuit simulation of QTMs, we previously introduced the class of uniform QCFs based on an…
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true…
Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits to produce accurate results for problems at useful scales. Furthermore, classical simulations of quantum circuits generally do not…
Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems…
I argue that Deutsch's model for the behavior of systems traveling around closed timelike curves (CTCs) relies implicitly on a substantive metaphysical assumption. Deutsch is employing a version of quantum theory with a significantly…
Frauchiger and Renner recently cast doubt on the universal applicability of Quantum Mechanics [1]. In the following, it is pointed out that their conclusion of one of three common-sense conditions, demanded for Quantum Mechanics, being…
Since the advent of quantum mechanics, classical probability interpretations have faced significant challenges. A notable issue arises with the emergence of negative probabilities when attempting to define the joint probability of…
Quantum computers have demonstrated utility in simulating quantum systems beyond brute-force classical approaches. As the community builds on these demonstrations to explore using quantum computing for applied research, algorithms and…
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in…
It has often been suggested that retrocausality offers a solution to some of the puzzles of quantum mechanics: e.g., that it allows a Lorentz-invariant explanation of Bell correlations, and other manifestations of quantum nonlocality,…
Various calculations of the $S$ matrix have shown that it seems to be non unitary for interacting fields when there are closed timelike curves. It is argued that this is because there is loss of quantum coherence caused by the fact that…
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries…
In 1941, Claude Shannon introduced the General Purpose Analog Computer(GPAC) as a mathematical model of Differential Analysers, that is to say as a model of continuous-time analog (mechanical, and later one electronic) machines of that…
In arXiv:1107.4675 Ralph uses our post-selection model of closed timelike curves (P-CTC) to construct an "unproven-theorem" paradox, and claims that this voids our argument that P-CTCs are able to resolve such types of paradoxes. Here we…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We present a review of the Unitary Coupled Cluster (UCC) ansatz and related ans\"atze which are used to variationally solve the electronic structure problem on quantum computers. A brief history of coupled cluster (CC) methods is provided,…
It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…
This paper furthers existing evidence that quantum computers are capable of computations beyond classical computers. Specifically, we strengthen the collapse of the polynomial hierarchy to the second level if: (i) Quantum computers with…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…