Related papers: An exponential time upper bound for Quantum Merlin…
We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N…
In this paper we study a time-inconsistent portfolio optimization problem for competitive agents with CARA utilities and non-exponential discounting. The utility of each agent depends on her own wealth and consumption as well as the…
A recent preprint by Mazzola and Carleo numerically investigates exponential challenges that can arise for the QC-QMC algorithm introduced in our work, "Unbiasing fermionic quantum Monte Carlo with a quantum computer." As discussed in our…
Entanglement and interference are among the most fundamental properties of quantum mechanics. In this work, we investigate the role and power of interference in the context of detecting entanglement. We do so from a computational complexity…
An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure…
Quantum metrology enhances the sensitivity of parameter estimation using the distinctive resources of quantum mechanics such as entanglement. It has been shown that the precision of estimating an overall multiplicative factor of a…
We construct a non-locality game that can be won with certainty by a quantum strategy using log n shared EPR-pairs, while any classical strategy has winning probability at most 1/2+O(log n/sqrt{n}). This improves upon a recent result of…
We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the…
We establish tight inapproximability bounds for max-LINSAT, the problem of maximizing the number of satisfied linear constraints over the finite field $\mathbb{F}_q$, where each constraint accepts $r$ values. Specifically, we prove by a…
In this paper, we settle the sampling complexity of solving discounted two-player turn-based zero-sum stochastic games up to polylogarithmic factors. Given a stochastic game with discount factor $\gamma\in(0,1)$ we provide an algorithm that…
We prove a general upper bound on the tradeoff between time and space that suffices for the reversible simulation of irreversible computation. Previously, only simulations using exponential time or quadratic space were known. The tradeoff…
Current fault-tolerant quantum compilers allocate error budgets uniformly during resource estimation, causing suboptimal physical resource overhead. We optimize this allocation using a potential game formulation, where Nash Equilibrium…
A cryptographic compiler introduced by Kalai et al. (STOC'23) converts any nonlocal game into an interactive protocol with a single computationally bounded prover. Although the compiler is known to be sound in the case of classical provers…
We show that the quantum linear harmonic oscillator can be obtained in the large $N$ limit of a classical deterministic system with SU(1,1) dynamical symmetry. This is done in analogy with recent work by G.'t Hooft who investigated a…
We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. We apply our framework to obtain the first FPT algorithm for the Unique Label Cover problem and new FPT algorithms with…
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem.…
We try to find an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average correct probability with and without a fixed rate of…
We give an alternative proof of PreciseQMA = PSPACE, first proved by Fefferman and Lin (Innov. Theor. Comp. Sci. 2018), where PreciseQMA is the class Quantum Merlin-Arthur with inverse exponential completeness-soundness gap. We adapt the…
We propose a new simple and natural algorithm for learning the optimal Q-value function of a discounted-cost Markov Decision Process (MDP) when the transition kernels are unknown. Unlike the classical learning algorithms for MDPs, such as…
We introduce a setup of model uncertainty in discrete time. In this setup we derive dual expressions for the super--replication prices of game options with upper semicontinuous payoffs. We show that the super--replication price is equal to…