Related papers: Unconstrained Summoning for relativistic quantum i…
Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…
From behavioral sciences to biology to quantum mechanics, one encounters situations where (i) a system outputs several random variables in response to several inputs, (ii) for each of these responses only some of the inputs may "directly"…
Classical transport equations with probabilistic initial conditions can be viewed as quantum systems. In a discrete version they are probabilistic automata. The time-local probabilistic information is encoded in a classical wave function.…
This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case.…
Voltage peaks on a conventional computer's power lines allow for the well-known dangerous DPA attacks. We show that measurement of a quantum computer's transient state during a computational step reveals information about a complete…
An important class of cryptographic applications of relativistic quantum information work as follows. B generates a random qudit and supplies it to A at point P. A is supposed to transmit it at near light speed c to to one of a number of…
Quantum Teleportation is the key communication functionality of the Quantum Internet, allowing the "transmission' of qubits without either the physical transfer of the particle storing the qubit or the violation of the quantum mechanical…
Independent studies by different authors have proposed that classicality may be induced in quantum objects by cosmological constraints presented by an expanding universe of finite extent in space-time. Cosmological effects on a quantum…
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state…
Stochastic models are highly relevant tools in science, engineering, and society. Recent work suggests emerging quantum computing technologies can substantially decrease the memory requirements for simulating stochastic models. Here we show…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
Free energy fixes the maximum work of a thermodynamic process once the state and Hamiltonian are specified. A work-extraction task asks a different question: how much average work can a single device realize across several preparations and…
We investigate an entangled deformation of the deterministic quantum cloning process, called enscription, that can be applied to (certain) sets of distinct quantum states which are not necessarily orthogonal, called texts. Some basic…
The principle of teleportation can be used to perform a quantum computation even before its quantum input is defined. The basic idea is to perform the quantum computation at some earlier time with qubits which are part of an entangled…
Formulating and designing authentication of classical messages in the presence of adversaries with quantum query access has been a longstanding challenge, as the familiar classical notions of unforgeability do not directly translate into…
We identify "proper quantum computation" with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish "no-go" theorems for classes of quantum optical experiments…
Spekkens has introduced an epistemically restricted classical theory of discrete systems, based on discrete phase space. The theory manifests a number of quantum-like properties but cannot fully imitate quantum theory because it is…
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…