Related papers: Revisiting Integer Factorization using Closed Time…

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,…

We analyse the existence of closed timelike curves in spacetimes which possess an isometry. In particular we check which discrete quotients of such spaces lead to closed timelike curves. As a by-product of our analysis, we prove that the…

Einstein's field equations of gravitation are known to admit closed timelike curve (CTC) solutions. Deutsch approached the problem from the quantum information point of view and proposed a self-consistency condition. In this work, the…

Relativistic quantum information combines the informational approach to understanding and using quantum mechanics systems - quantum information - with the relativistic view of the universe. In this introductory review we examine key results…

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…

We study the nature of entanglement in presence of Deutschian closed timelike curves (D-CTCs) and we observe that qubits traveling along a D-CTC allow unambiguous discrimination of Bell states with Local Operations and Classical…

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…

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…

The numerical integration of the Schr\"odinger equation by discretization of time is explored for the curved manifolds arising from finite representations based on evolving basis states. In particular, the unitarity of the evolution is…

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…

General relativity allows solutions exhibiting closed timelike curves. Time travel generates paradoxes and quantum mechanics generalizations were proposed to solve those paradoxes. The implications of self-consistent interactions on acausal…

We extend the argument that spacetimes generated by two timelike particles in D=3 gravity (or equivalently by parallel-moving cosmic strings in D=4) permit closed timelike curves (CTC) only at the price of Misner identifications that…

Given a graph with positive and negative edge labels, the correlation clustering problem aims to cluster the nodes so to minimize the total number of between-cluster positive and within-cluster negative edges. This problem has many…

Clustering temporal and dynamically changing multivariate time series from real-world fields, called temporal clustering for short, has been a major challenge due to inherent complexities. Although several deep temporal clustering…

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's Problem - a black box period-finding problem which has an exponential gap between the classical and quantum runtime. Using an…

The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence…

Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…

Quantum computing is a winsome field that concerns with the behaviour and nature of energy at the quantum level to improve the efficiency of computations. In recent years, quantum computation is receiving much attention for its capability…

The availability of working quantum computers has led to several proposals and claims of quantum advantage. In 2023, this has included claims that quantum computers can successfully factor large integers, by optimizing the search for nearby…