Related papers: Simulations of closed timelike curves
In this paper, model predictive control (MPC) strategies are proposed for dead-beat control of linear systems with and without state and control constraints. In unconstrained MPC, deadbeat performance can be guaranteed by setting the…
We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using…
The author's research of topologies of parallel computing systems and the tasks solved with them, including the corresponding tools of their modeling, is summarized in the present paper. The original topological model of such systems is…
Quantum computers promise to perform computations beyond the reach of modern computers with profound implications for scientific research. Due to remarkable technological advances, small scale devices are now becoming available for use. One…
The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTMs) has been proposed to characterise which behaviours are…
Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum…
Understanding the impact of gate errors on quantum circuits is crucial to determining the potential applications of quantum computers, especially in the absence of large-scale error-corrected hardware. We put forward analytical arguments,…
Quantum phase transitions have been shown to be highly beneficial for quantum sensing, owing to diverging quantum Fisher information close to criticality. In this work we consider a periodically modulated Lipkin-Meshkov-Glick model to show…
The CTC model has been widely applied to many application scenarios because of its simple structure, excellent performance, and fast inference speed. There are many peaks in the probability distribution predicted by the CTC models, and each…
Analyses of serially-sampled data often begin with the assumption that the observations represent discrete samples from a latent continuous-time stochastic process. The continuous-time Markov chain (CTMC) is one such generative model whose…
Discrete quantum walks are dynamical protocols for controlling a single quantum particle. Despite of its simplicity, quantum walks display rich topological phenomena and provide one of the simplest systems to study and understand…
Closed timelike curves are striking predictions of general relativity allowing for time-travel. They are afflicted by notorious causality issues (e.g. grandfather's paradox). Quantum models where a qubit travels back in time solve these…
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce a chosen initial state, however, for the final state measurement chooses a…
The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical…
The thermodynamic entropy of coarse-grained (CG) models stands as one of the most important properties for quantifying the missing information during the CG process and for establishing transferable (or extendible) CG interactions. However,…
Simulation of a quantum many-body system at finite temperatures is crucially important but quite challenging. Here we present an experimentally feasible quantum algorithm assisted with continuous-variable for simulating quantum systems at…
Classical simulation of quantum computers is an irreplaceable step in the design of quantum algorithms. Exponential simulation costs demand the use of high-performance computing techniques, and in particular distribution, whereby the…
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative.…
A cryptographic protocol (CP) is a distributed algorithm designed to provide a secure communication in an insecure environment. CPs are used, for example, in electronic payments, electronic voting procedures, database access systems, etc.…
In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it…