Related papers: An exponential time upper bound for Quantum Merlin…
In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a…
We consider the clock game-a task formulated in the framework of quantum information theory-that can be used to improve the existing schemes of quantum-enhanced telescopy. The problem of learning when a stellar photon reaches a telescope is…
This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness. That is, QCMA = QCMA1. This holds under any gate set with which the Hadamard and arbitrary classical reversible transformations…
We derive a sharp bound as the quantum speed limit (QSL) for the minimal evolution time of quantum open systems in the non-Markovian strong-coupling regime with initial mixed states by considering the effects of both renormalized…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
We derive a Geometric quantum speed limit (QSL) for imaginary-time evolution, where the dynamics is governed by a non-unitary Schr\"{o}dinger equation. By introducing a cost function based on the angular distance between the normalized…
We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability…
We show that any language in nondeterministic time $\exp(\exp(\cdots \exp(n)))$, where the number of iterated exponentials is an arbitrary function $R(n)$, can be decided by a multiprover interactive proof system with a classical…
We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
Given a mixture of states, finding a way to optimally discriminate its elements is a prominent problem in quantum communication theory. In this paper, we will address mixtures of density operators that are unitarily equivalent via elements…
In this paper, we introduce a new public quantum interactive proof system and the first quantum alternating Turing machine: qAM proof system and qATM, respectively. Both are obtained from their classical counterparts (Arthur-Merlin proof…
The non-extensibility of quantum theory into a theory with improved predictive power is based on a strong assumption of independent free choice, in which the physicists pick a measurement axis independently of anything that couldn't have…
We show that Set Cover on instances with $N$ elements cannot be approximated within $(1-\gamma)\ln N$-factor in time exp($N^{\gamma-\delta})$, for any $0 < \gamma < 1$ and any $\delta > 0$, assuming the Exponential Time Hypothesis. This…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a…
This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless…
In this paper by using geometric techniques, we provide upper bounds for the Poincar\'e recurrence time of a quantum mixed state with discrete spectrum of energies. In the case of discrete but finite spectrum we obtain two type of upper…
We study an infinite-horizon discrete-time optimal stopping problem under non-exponential discounting. A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria. When the discount function…
Time symmetry in quantum mechanics, where the current quantum state is determined jointly by both the past and the future, offers a more comprehensive description of physical phenomena. This symmetry facilitates both forward and backward…