Related papers: Closed timelike curves in measurement-based quantu…
Certain concrete "ontological models" for quantum mechanics (models in which measurement outcomes are deterministic and quantum states are equivalent to classical probability distributions over some space of `hidden variables') are…
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…
Quantum dynamics on curved spacetime has never been directly probed beyond the Newtonian limit. Although we can describe such dynamics theoretically, experiments would provide empirical evidence that quantum theory holds even in this…
Measurement-based quantum computation (MBQC) is a protocol for quantum computation that represents a model distinct from the circuit-based approach. MBQC has been proposed not only for qubits but also for qudits, continuous-variable (CV)…
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in…
One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms. By applying a…
In this paper, we consider some causality violating solutions in the curvature-squared gravity in order to examine whether closed timelike curves (CTCs) are allowed in these models. These aspects are studied in terms of the G\"odel,…
Quantum theory (QT) provides statistical predictions for various physical phenomena. The outcomes of these measurements are in general some numerical time series registered by some macroscopic instruments. The various empirical probability…
We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog…
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique further develops tools from many-body physics - based on finitely correlated or projected entangled pair states -…
The concept of qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. \textbf{86}, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. We…
A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…
The linear Schr\"odinger equation with piecewise constant potential in one spatial dimension is a well-studied textbook problem. It is one of only a few solvable models in quantum mechanics and shares many qualitative features with…
We investigate quantum correlations in time in different approaches. We assume that temporal correlations should be treated in an even-handed manner with spatial correlations. We compare the pseudo-density matrix formalism with several…
We show that qubits traveling along closed timelike curves are a resource that a party can exploit to distinguish perfectly any set of quantum states. As a result, an adversary with access to closed timelike curves can break any…
A ring resonator involves a scattering process where a part of the output is fed again into the input. The same formal structure is encountered in the problem of time travel in a neighborhood of a closed timelike curve (CTC). We know how to…
In phase space, we analytically obtain the characteristic functions (CFs) of a forced harmonic oscillator [Talkner et al., Phys. Rev. E, 75, 050102 (2007)], a time-dependent mass and frequency harmonic oscillator [Deffner and Lutz, Phys.…
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved…
Symplectic quantization is a functional approach to quantum field theory that allows sampling of quantum fluctuations directly in Minkowski space time by means of a generalized Hamiltonian dynamics in an extra time variable $\tau$ which, at…
Verifying quantum systems has attracted a lot of interest in the last decades.In this paper, we study the quantitative model-checking of quantum continuous-time Markov chains (quantum CTMCs). The branching-time properties of quantum CTMCs…