Preprints

Computer Science Group Preprints

Year Content Icon
J. Lumbreras, Mikhail Terekhov, M. Tomamichel Learning pure quantum states (almost) without regret.
Shrigyan Brahmachari , R. Rubboli, M. Tomamichel A fixed-point algorithm for matrix projections with applications in quantum information.
E. Cervero, M. Tomamichel Device independent security of quantum key distribution from monogamy-of-entanglement games.
E. Cervero, Laura ManÄÂinska Weak Schur sampling with logarithmic quantum memory.
M. Tomamichel, A.B.Salman Lower Bounds on Error Exponents via a New Quantum Decoder.
R. Rubboli, Ryuji Takagi, M. Tomamichel Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond.
Juha-Pekka Pellonpää, Erkka Haapasalo, Roope Uola Barycentric decomposition for quantum instruments.
Muhammad Usman Farooq, Tobias Fritz, Erkka Haapasalo, M. Tomamichel Asymptotic and catalytic matrix majorization.
Y. Ouyang, Gavin K. Brennen Quantum error correction on symmetric quantum sensors.
Roope Uola, Erkka Haapasalo, Juha-Pekka Pellonpää, Tom Kuusela Retrievability of information in quantum and realistic hidden variable theories.
R. Rubboli, M. Tomamichel New additivity properties of the relative entropy of entanglement and its generalizations.
M. Tomamichel, Y. Li, C. Hirche Sequential Quantum Channel Discrimination.
Erkka Haapasalo Joint measurements through quantum broadcasting.
M. Hayashi, Y. Ouyang Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming.
Cosmo Lupo, Y. Ouyang Quantum key distribution with non-ideal heterodyne detection.
Ernest Tan, S.Kundu Composably secure device-independent encryption with certified deletion.
Upendra Kapshikar, N.G. Boddu Tamper Detection against Unitary Operators.
D. Aggarwal, R. Jain, N.G. Boddu, Maciej Lukasz Obremski Quantum Measurement Adversary.
D. Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
D. Aggarwal, Joao Ribeiro, Mark Simkin , Luisa Siniscalchi, Maciej Lukasz Obremski Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
D. Aggarwal, Maciej Lukasz Obremski Inception makes non-malleable codes shorter as well!.
Anurag Anshu, R. Jain, Alexander Streltsov Quantum state redistribution with local coherence.
A. Anshu, A. Anshu, M. Hayashi, NA Warsi Secure communication over fully quantum Gelfand-Pinsker wiretap channel.
I. Kerenidis, Alessandro Luongo Quantum classification of the MNIST dataset via Slow Feature Analysis.
Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, Antonios Varvitsiotis Vector Coloring the Categorical Product of Graphs.
I. Arad, Eyal Bairey, Netanel H. Lindner Learning a local Hamiltonian from local measurements.
Juan Miguel Arrazola, Eleni Diamanti, I. Kerenidis Quantum superiority for verifying NP-complete problems with linear optics.
Anurag Anshu, M. Hayashi, Naqueeb Ahmad Warsi Secure communication over fully quantum Gelfand-Pinsker wiretap channel.
Gus Gutoski, Ansis Rosmanis, Jamie William Jonathon Sikora Fidelity of quantum strategies with applications to cryptography.
Zhaohui Wei, Jamie William Jonathon Sikora Device-independent dimension test in a multiparty Bell experiment.
John Selby, Jamie William Jonathon Sikora A simple proof of the impossibility of bit-commitment in generalised probabilistic theories using cone programming.
A. Anshu, A. Anshu, R. Jain, NA Warsi A unified approach to source and message compression.
Ritajit Majumdar, Saikat Basu, P. Mukhopadhyay, Susmita Sur-Kolay Error tracing in linear and concatenated quantum circuits.
P. Mukhopadhyay, Y. Qiao Sparse multivariate polynomial interpolation in the basis of Schubert polynomials.
Jaikumar Radhakrishnan, Pranab Sen, NA Warsi One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma.
A. Anshu, A. Anshu A lower bound on expected communication cost of quantum state redistribution.
Tomotaka Kuwahara, I. Arad, L. Amico, V. Vedral Local reversibility and entanglement structure of many-body ground states.
A. Pereszlenyi One-Sided Error QMA with Shared EPR Pairs -- A Simpler Proof.
R. Jain, Nisheeth K. Vishnoi, T. Lee, T. Lee A quadratically tight partition bound for classical communication complexity and query complexity.
R. Jain, P. Yao A strong direct product theorem in terms of the smooth rectangle bound.
M.E. McKague, L. Sheridan Insider-proof encryption with applications for quantum key distribution.
A. Pereszlenyi Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap.
R. Jain, P. Yao A parallel approximation algorithm for mixed packing and covering semidefinite programs.
Aleksandrs Belovs, T. Lee, T. Lee Quantum Algorithm for k-distinctness with Prior Knowledge on the Input.
Anne Broadbent, J. Fitzsimons, Elham Kashefi QMIP = MIP*.
Marcus Schaffry, Erik M. Gauger, John J. L. Morton, J. Fitzsimons, Simon C. Benjamin Ensemble based quantum metrology.
Matthew McKague BQP interactive proof for recursive Fourier sampling.
T. Lee, T. Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek An adversary for algorithms.
Ming Lam Leung, Yang Li, Shengyu Zhang Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models.
S. Zhang Quantum Strategic Game Theory.
I. Kerenidis, S. Zhang A quantum protocol for sampling correlated equilibria unconditionally and without a mediator.