Related papers: Computation with narrow CTCs
Recently, there has been much interest in the evolution of quantum particles on closed time-like curves (CTCs). However, such models typically assume point-like particles with only two degrees of freedom - a very questionable assumption…
Toy models for quantum evolution in the presence of closed timelike curves (CTCs) have gained attention in the recent literature due to the strange effects they predict. The circuits that give rise to these effects appear quite abstract and…
We consider causality respecting (CR) quantum systems interacting with closed timelike curves (CTCs), within the Deutsch model. We introduce the concepts of popping up and elimination of quantum information and use them to show that…
Cumulative memory -- the sum of space used per step over the duration of a computation -- is a fine-grained measure of time-space complexity that was introduced to analyze cryptographic applications like password hashing. It is a more…
A polynomial Turing compression (PTC) for a parameterized problem $L$ is a polynomial time Turing machine that has access to an oracle for a problem $L'$ such that a polynomial in the input parameter bounds each query. Meanwhile, a…
This paper presents novel Weighted Finite-State Transducer (WFST) topologies to implement Connectionist Temporal Classification (CTC)-like algorithms for automatic speech recognition. Three new CTC variants are proposed: (1) the…
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
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…
A condition proposed by David Deutsch to describe analogues of processes in the presence of closed timelike curves (D-CTC condition) in bipartite quantum systems is investigated within the framework of local relativistic quantum field…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of…
Inspired by some recent works of Tippett-Tsang and Mallary-Khanna-Price, we present a new spacetime model containing closed timelike curves (CTCs). This model is obtained postulating an ad hoc Lorentzian metric on $\mathbb{R}^4$, which…
We study the capacity of a quantum channel for retrocausal communication, where messages are transmitted backward in time, from a sender in the future to a receiver in the past, through a noisy postselected closed timelike curve (P-CTC)…
We propose a new application of quantum computing to the field of natural language processing. Ongoing work in this field attempts to incorporate grammatical structure into algorithms that compute meaning. In (Coecke, Sadrzadeh and Clark,…
A recent paper from Brun et al. has argued that access to a closed timelike curve (CTC) would allow for the possibility of perfectly distinguishing nonorthogonal quantum states. This result can be used to develop a protocol for…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
While the relationship of time and space is an established topic in traditional centralised complexity theory, this is not the case in distributed computing. We aim to remedy this by studying the time and space complexity of algorithms in a…
Quantum computers are predicted to utilize quantum states to perform memory and to process tasks far faster than those of conventional classical computers. In this paper we show a new road towards building fault tolerance quantum computer…
Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We…