Year Content Icon
I. Kerenidis, S. Zhang A quantum protocol for sampling correlated equilibria unconditionally and without a mediator.
J. I. Latorre, German Sierra Quantum Computation of Prime Number Functions.
B. Rosgen, Lorna Stewart The overlap number of a graph.
S. Zhang Quantum Strategic Game Theory.
Ming Lam Leung, Yang Li, Shengyu Zhang Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models.
T. Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek An adversary for algorithms.
Matthew McKague BQP interactive proof for recursive Fourier sampling.
Anne Broadbent, J. Fitzsimons, Elham Kashefi QMIP = MIP*.
A.Prakash, A.Varvitsiotis Matrix factorizations of correlation matrices and applications.
R. Jain, Nisheeth K. Vishnoi, T. Lee A quadratically tight partition bound for classical communication complexity and query complexity.
Ritajit Majumdar, Saikat Basu, P. Mukhopadhyay, Susmita Sur-Kolay Error tracing in linear and concatenated quantum circuits.
Andrew C. Doherty, S. Wehner Convergence of SDP hierarchies for polynomial optimization on the hypersphere.
R. Jain, P. Yao A strong direct product theorem in terms of the smooth rectangle bound.
A. Anshu, N.G. Boddu, Naresh Goud Boddu, R. Jain, S.Kundu, P. Mukhopadhyay Lifting randomized query complexity to randomized communication complexity.
H. Klauck, S. Podder New Bounds for the Garden-Hose Model.
P. Mukhopadhyay, Y. Qiao Sparse multivariate polynomial interpolation in the basis of Schubert polynomials.
G. Ivanyos, Péter Kutas, Lajos Rónyai Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$.
W.Y Suen, J. Thompson, A.Garner, V. Vedral, M. Gu The classical-quantum divergence of complexity in the Ising spin chain.
A.Garner, J. Thompson, V. Vedral, M. Gu When is simpler thermodynamically better?.
J. Thompson, A.Garner, V. Vedral, M. Gu Using quantum theory to reduce the complexity of input-output processes.
G. Ivanyos, Youming Qiao, K. V. Subrahmanyam Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.
T. Lee, Z.H. Wei, Ronald de Wolf Some upper and lower bounds on PSD-rank.