Related papers: A relational time-symmetric framework for analyzin…
We investigate an optimization problem of finding quantum sequential measurements, which forms a wide class of state discrimination problems with the restriction that only sequential measurements are allowed. Sequential measurements from…
We propose a quantum clock synchronization protocol in which Bob makes a remote measurement on Alice's quantum clock via a third qubit acting as its proxy. It is shown that the resulting correlations are dependent on the choice of the…
Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learning task using only a fixed number of queries. In this work,…
An open quantum system leaks information into its environment. In some circumstances it is possible for an observer, say Alice, to recover that information, as a classical measurement record, in a variety of different ways, using different…
We investigate the correlations that can arise between Alice and Bob in prepare-and-measure communication scenarios where the source (Alice) and the measurement device (Bob) can share prior entanglement. The paradigmatic example of such a…
Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in $\sqrt{N \beta/{\cal Z}}$ and polynomial in…
In the quantum theory, it has been shown that one can see if a process has the time reversal symmetry by applying the matrix transposition and examining if it remains physical. However, recent discoveries regarding the indefinite causal…
We introduce a local concept of speed-up applicable to intermediate stages of a quantum algorithm. We use it to analyse the complementary roles played by quantum parallel computation and quantum measurement in yielding the speed-up. A…
Microscopic quantum laws are time-symmetric: nothing in the Schr\"odinger equation or its relativistic extensions distinguishes future from past. Yet measurements produce irreversible records, an apparently one-way causal flow, and the…
Quantum information has suggested new forms of quantum logic, called quantum computational logics, where meanings of sentences are represented by pieces of quantum information (generally, density operators of some Hilbert spaces), which can…
Quantum state smoothing is a technique to construct an estimate of the quantum state at a particular time, conditioned on a measurement record from both before and after that time. The technique assumes that an observer, Alice, monitors…
Quantum direct coding or Schumacher compression generalised the ideas of Shannon theory, gave an operational meaning to the von Neumann entropy and established the term qubit. But remembering that information processing is carried out by…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…
Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between…
We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee. Bob, is sampling from a classical distribution on a quantum device that is…
We demonstrate that two spatially separated parties (Alice and Bob) can utilize shared prior quantum entanglement, and classical communications, to establish a synchronized pair of atomic clocks. In contrast to classical synchronization…
Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum…
Quantum algorithms theoretically outperform classical algorithms in solving problems of increasing size, but computational errors must be kept to a minimum to realize this potential. Despite the development of increasingly capable quantum…