Related papers: Revisiting Integer Factorization using Closed Time…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…
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…
Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. On current quantum processors with notable gate imperfections, there is a critical tradeoff between improved accuracy for finer…
Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
This paper proposes a quantum algorithm for the capacitated vehicle routing problem with time windows (CVRPTW) based on Grover Search framework. This problem is often faced by Postal services in the context of package delivery or other…
Unsupervised learning of time series data, also known as temporal clustering, is a challenging problem in machine learning. Here we propose a novel algorithm, Deep Temporal Clustering (DTC), to naturally integrate dimensionality reduction…
Curvature is a key notion in General Relativity, characterizing the local physical properties of spacetime. By contrast, the concept of curvature has received scant attention in nonperturbative quantum gravity. One may even wonder whether…
Quantum models of computation are widely believed to be more powerful than classical ones. Efforts center on proving that, for a given problem, quantum algorithms are more resource efficient than any classical one. All this, however,…
In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form. Thereby, it is crucial to find (multiple) transformation paths…
Quantum algorithms for solving noisy linear problems are reexamined, under the same assumptions taken from the existing literature. The findings of this work include on the one hand extended applicability of the quantum Fourier transform to…
A temporal (constraint) language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for temporal constraint…
Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum…
According to the set theory, we prove that objects moving along closed timelike curves (CTCs) should belong to proper classes, but never to any set. Particles in a set have to change own some properties when they come into a CVC in order to…
It has long been known that generic solutions to the nonlinear DGP and Galileon models admit superluminal propagation. In this note we present a solution of these models which also admits closed timelike curves (CTCs). We observe that these…
Time continues to be an intriguing physical property in the modern era. On the one hand, we have the Classical and Relativistic notion of time, where space and time have the same hierarchy, which is essential in describing events in…
Canonical quantization applied to closed systems leads to static equations, the Wheeler-deWitt equation in Quantum Gravity and the time independent Schr\"odinger equation in Quantum Mechanics. How to restore time is the Problem of Time(s).…
We introduce a constructive procedure that maps all spatial correlations of a broad class of states into temporal correlations between general quantum measurements. This allows us to present temporal phenomena analogous to genuinely…
We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ a process of embedding the codewords of an error-correcting…
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…