Related papers: Computation with narrow CTCs
We define a new quantity we call a ctcbit that provides a means for quantifying a qubit on a closed time-like curve (CTC) as a shared resource. We describe a simple protocol for the sharing of information that is similar to quantum…
We introduce a general categorical framework to reason about quantum theory and other process theories living in spacetimes where Closed Timelike Curves (CTCs) are available, allowing resources to travel back in time and provide…
Generalized quantum mechanics is used to examine a simple two-particle scattering experiment in which there is a bounded region of closed timelike curves (CTCs) in the experiment's future. The transitional probability is shown to depend on…
In principe, General Relativity seems to allow the existence of closed timelike curves (CTC). However, when quantum effects are considered, it is likely that their existence is prevented by some kind of chronological protection mechanism,…
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical…
Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes…
Notoriously, the Einstein equations of general relativity have solutions in which closed timelike curves (CTCs) occur. On these curves time loops back onto itself, which has exotic consequences. However, in order to make time travel stories…
The theory of general relativity predicts the existence of closed time-like curves (CTCs), which theoretically would allow an observer to travel back in time and interact with their past self. This raises the question of whether this could…
As we enter the era of useful quantum computers we need to better understand the limitations of classical support hardware, and develop mitigation techniques to ensure effective qubit utilisation. In this paper we discuss three key…
In this comment on S.Lloyd, et al, Phys.Rev.Lett. 106, 040403 (2011), we show that modelling closed timelike curves (CTCs) as post-selected teleportation allows signalling to past times before the creation of the CTC and allows information…
Bennett and Schumacher's postselected quantum teleportation is a model of closed timelike curves (CTCs) that leads to results physically different from Deutsch's model. We show that even a single qubit passing through a postselected CTC…
General relativity predicts the existence of closed timelike curves (CTCs), along which an object could travel to its own past. A consequence of CTCs is the failure of determinism, even for classical systems: one initial condition can…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\i lmaz 2014, arXiv:1411.7647). In this…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
Any given prescription of quantum time travel necessarily endows a Hilbert space to the chronology-violating (CV) system on the closed timelike curve (CTC). However, under the two foremost models, Deutsch's prescription (D-CTCs) and…
We show that the computational power of the non-causal circuit model, i.e., the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity…
The combination of machine learning and quantum computing has emerged as a promising approach for addressing previously untenable problems. Reservoir computing is an efficient learning paradigm that utilizes nonlinear dynamical systems for…
Connectionist temporal classification (CTC) is a popular sequence prediction approach for automatic speech recognition that is typically used with models based on recurrent neural networks (RNNs). We explore whether deep convolutional…
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations…