Quantum Computing Publications

Photo credits: tex.stackexchange.com

Quantum Computer Science Axis
01 Jan 2018 / 29 Feb 2020 

Total Number of Publications = 19
Total Number of Conference Papers = 8
Total Number of Book Chapters = 4
Total Number of Manuscripts = 8 

In black boldface: MajuLab staff
In blue boldface: MajuLab associated staff
In purple boldface: MajuLab Alumni

Year 2020

Publications                 5

 Observation of exciton polariton condensation in a perovskite lattice at room temperature.
Rui Su, Sanjib Ghosh, Jun Wang, Sheng Liu, Carole Diederichs, Timothy C. H. Liew, and Qihua Xiong
Nat. Phys. (2020) https://doi.org/10.1038/s41567-019-0764-5                     Tier1A – IF 20.113
arXiv:1906.1156618 pages

Quantum computing with exciton-polariton condensates
Sanjib Ghosh, and Timothy C. H. Liew
NPJ Quantum Inf. 6, 16 (2020) – 6 pages                                                         Tier1A – IF 9.32 

Novel properties and applications of chiral inorganic structures
Lian Xio, Tingting An, Lin Wang, Xialing Xu, and Handong Sun
Nano Today 30, 100824 (2020) – 26 pages                                                    Tier1A – IF 16.582 

Long-lifetime coherence in a quantum emitter induced by a metasurface
Emmanuel Lassalle, Philippe Lalanne, Syed Aljunid, Patrice Genevet, Brian Stout, Thomas Durt, and David Wilkowski
Phys. Rev. A 101, 013837 (2020) – 14 pages                                                   Tier1A – IF 2.907
arXiv:1909.02409

Chiral-perovskite optoelectronics
Guankui Long, Randy Sabatini, Makhsud I. Saidaminov, Girish Lakhwani, Abdullah Rasmita, Xiaogang Liu, Edward H. Sargent, and Weibo Gao
Nat. Rev. Mat. (2020) – 17 pages                                                                                            NA
https://doi.org/10.1038/s41578-020-0181-5 

Book Chapters             NA
Manuscripts                 NA

Year 2019

Publications                 6 

Quantum and Classical Algorithms for Approximate Submodular Function Minimization
Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, and Miklos Santha
Quantum Information & Computation 19, 1325 (2019) – 25 pages                                 IF 1.517
arXiv:1907.05378

Device-independent dimension test in a multiparty Bell experiment
Zhaohui Wei, and Jamie Sikora
New Journal of Physics 21, 043021 (2019) – 10 pages                                     Tier1B – IF 3.77 

A minimax approach to one-shot entropy inequalities
Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel
Journal of Mathematical Physics 60, 122201 (2019) – 7 pages                                      IF 1.355
arXiv:1906.00333

On the near-optimality of one-shot classical communication over quantum channels
Anurag Anshu,  Rahul Jain, and Naqueeb A. Warsi
Journal of Mathematical Physics 60, 012204 (2019) – 19 pages                                    IF 1.355
arXiv:1804.09644

A hypothesis testing approach for communication over entanglement-assisted compound quantum channel
Anshu, R. Jain, and N. A. Warsi
IEEE Transactions on Information Theory 65, 2623 (2019) – 14 pages                  Tier1A – IF 3.215
arXiv:1706.08286

Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction
Anurag Anshu, Rahul Jain, and Naqueeb A. Warsi
IEEE Transactions on Information Theory 65, 5905 (2019) – 20 pages                   Tier1A – IF 3.215
arXiv:1703.02342
                                                                                                                                               NA

Conference Papers       3 

Second-Order Characterizations via Partial Smoothing
Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel
2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, 937
5 pages                                                                                                                                  Tier1

One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, and Javier R. Fonollosa
2019 IEEE International Symposium on Information Theory (ISIT)
24 pages                                                                                                                                Tier1
arXiv:1809.07104

A composition theorem for randomized query complexity via max-conflict complexity
Gavinsky, T. Lee, M. Santha, and S. Sanyal.
46th International Colloquium on Automata, Languages and Programming, Patras, 64:1 (2019)
13 pages

Book Chapters             1

Strategies for Quantum Races
Troy Lee, Maharshi Ray, and Miklos Santha
10th Innovations in Theoretical Computer Science (ITCS 2019), Avrim Blum (Ed.), Article No. 51; Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz Zentrum für Informatik, Dagstuhl Publishing, Germany (2019) – 21 pages                                                                                                  NA
arXiv:1809.03671

Manuscript                  2

Discrete logarithm and Diffie-Hellman problems in identity black-box groups
Gabor Ivanyos, Antoine Joux, and Miklos Santha
arXiv:1911.0166212 pages

The aBc Problem and Equator Sampling Renyi Divergences
Hartmut Klauck, Debbie Lim
arXiv:1912.1127525 pages

Year 2018

Publications                 12 

Quantifying Resources in General Resource Theory with Catalysts
Anshu, M. H. Hsieh, and R. Jain
Phys. Rev. Lett. 121, 190504 (2018) – 6 pages                                                 Tier1A – IF 9.227
arXiv:1708.00381

Ground State Connectivity of Local Hamiltonians
Gharibian, and J. Sikora
ACM Transactions on Computation Theory (TOCT) 10, 8 (2018) – 28 pages                                NA
arXiv:1409.3182

A One-Shot Achievability Result for Quantum State Redistribution
Anshu, R. Jain, and N. A. Warsi
IEEE Transactions on Information Theory 64, 1425 (2018) – 11 pages                  Tier1A – IF 3.215
arXiv:1702.02396

A Generalized Quantum Slepian-Wolf
Anshu, R. Jain, and N. A. Warsi
IEEE Transactions on Information Theory 64, 1436 (2018) – 18 pages                  Tier1A – IF 3.215
arXiv:1703.09961

Building blocks for communication over noisy quantum networks
Anshu, R. Jain, and N. A. Warsi
IEEE Transactions on Information Theory 65, 1287 (2018) – 20 pages                  Tier1A – IF 3.215
arXiv:1702.01940

Extension Complexity of Independent Set Polytopes
Mika Göös, R. Jain, and Thomas Watson
SIAM J. Comput. 47, 241 (2018) – 29 pages                                                     Tier1A – IF 1.563
arXiv:1604.07062

Linear time algorithm for quantum 2SAT
Arad, M. Santha, A. Sundaram, and S. Zhang
Theory of Computing 14, 1 (2018) – 27 pages                                                              IF 1.300
arXiv:1508.06340

Quantum attacks on Bitcoin, and how to protect against them
Aggarwal, G. Brennen, T. Lee, M. Santha, and M. Tomamichel
Ledger 3, 68 (2018) – 23 pages                                                                                              NA
arXiv:1710.10377

On the complexity of trial and error for constraint satisfaction problems
Ivanyos, R. Kulkarni, Y. Qiao, M. Santha, and A. Sundaram
Journal of Computer and System Sciences 92, 48-64 (2018) – 17 pages                         IF 1.129
arXiv:1406.5336

Polynomial interpolation and identity testing from high powers over finite fields
Ivanyos, M. Karpinski, M. Santha, N. Saxena, and I. Shparlinski
Algorithmica 80, 560 (2018) – 16 pages                                                          Tier1B – IF 1.129
arXiv:1502.06631

Completely positive semidefinite rank
Prakash, J. Sikora, A. Varvitsiotis, and Z. Wei
Mathematical Programming 171, 397 (2018) – 35 pages                                  Tier1A – IF 3.785
arXiv:1604.07199

Fidelity of quantum strategies with applications to cryptography
Gus Gutoski, Ansis Rosmanis, and Jamie Sikora
Quantum 2, 89 (2018) – 20 pages                                                                                           NA
arXiv:1704.04033

Conference Papers       5

On learning linear functions from subset and its applications in quantum computing
Ivanyos, A. Prakash, and M. Santha
26th Annual European Symposium on Algorithms, Helsinki, 66:1 (2018) – 14 pages                                  NA
arXiv:1806.09660

A hypothesis testing approach for communication over entanglement assisted compound quantum channel
Anshu, R. Jain, and N. A. Warsi
2018 IEEE International Symposium on Information Theory (ISIT), 1794 (2018)
14 pages                                                                                                                                Tier1
arXiv:1706.08286

One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels
Salek, A. Anshu, M. H. Hsieh, R. Jain, and J. R. Fonollosa
2018 IEEE International Symposium on Information Theory, CO, USA 296 (2018) – 5 pages                     Tier1

Partially smoothed information measures
Anshu, M. Berta, R. Jain, and M. Tomamichel
Workshop Beyond I.I.D. in Information Theory, 23-27 July, Cambridge, UK (2018)                                  NA
arXiv:1807.0563025 pages

Parallel device-independent quantum key distribution
Jain, C. A. Miller, and Y. Shi
8th International Conference on Quantum Cryptography, Shanghai (China), 27–31 August (2018)
arXiv:1703.0542633 pages                                                                                                NA

Book Chapters 3

Quadratically Tight Relations for Randomized Query Complexity
Gavinsky, R. Jain, H. Klauck, S. Kundu, T. Lee, M. Santha, S. Sanyal, and J. Vihrovs
In: F. Fomin, V. Podolskii (eds), Computer Science – Theory and Applications. CSR 2018. Lecture Notes in Computer Science, vol 10846, Springer, Cham, 207 (2018) – 13 pages                                          NA
arXiv:1708.00822

A new public-key cryptosystem via Mersenne numbers
Aggarwal, A. Joux, A. Prakash, and M. Santha
In: Shacham H., Boldyreva A. (eds), Advances in Cryptology – CRYPTO 2018, Lecture Notes in Computer Science, vol 10993, 459, Springer, Cham – 24 pages                                                                      NA 

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka
Proceedings of 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Editors: Igor Potapov, Paul Spirakis, and James Worrell; Article No. 58; pp. 58:1–58:16, Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz Zentrum für Informatik, Dagstuhl Publishing, Germany (2018) – 16 pages                                                                                                   NA
arXiv:1805.11139

Manuscripts                 6 

Quantum state redistribution with local coherence
Anshu, R. Jain, and A. Streltsov
arXiv:1804.0491518 pages 

Quantum decoupling via efficient `classical’ operations and the entanglement cost of one-shot quantum protocols
Anshu, and R. Jain
arXiv:1809.0705646 pages 

Noisy quantum state redistribution with promise and the Alpha-bit
Anshu, M.-H. Hsieh, and R. Jain
arXiv:1803.0341424 pages

The power of one clean qubit in communication complexity
Hartmut Klauck, and Debbie Lim
arXiv:1807.0776227 pages 

Efficient methods for one-shot quantum communication
Anurag Anshu, and Rahul Jain
arXiv:1809.0705646 pages 

Total Functions in QMA
Serge Massar, and Miklos Santha
arXiv:1805.0067026 pages