@article{63741,
author = {{Thomas, S. E. and Hird, T. M. and Munns, J. H. D. and Brecht, Benjamin and Saunders, D. J. and Nunn, J. and Walmsley, I. A. and Ledingham, P. M.}},
issn = {{2469-9926}},
journal = {{Physical Review A}},
number = {{3}},
publisher = {{American Physical Society (APS)}},
title = {{{Raman quantum memory with built-in suppression of four-wave-mixing noise}}},
doi = {{10.1103/physreva.100.033801}},
volume = {{100}},
year = {{2019}},
}
@article{63742,
author = {{Gao, S. and Lazo-Arjona, O. and Brecht, Benjamin and Kaczmarek, K. T. and Thomas, S. E. and Nunn, J. and Ledingham, P. M. and Saunders, D. J. and Walmsley, I. A.}},
issn = {{0031-9007}},
journal = {{Physical Review Letters}},
number = {{21}},
publisher = {{American Physical Society (APS)}},
title = {{{Optimal Coherent Filtering for Single Noisy Photons}}},
doi = {{10.1103/physrevlett.123.213604}},
volume = {{123}},
year = {{2019}},
}
@inproceedings{41911,
author = {{Zeuner, K D and Paul, M and Lettner, T and Hedlund, C Reuterskiöld Reuterskiöld and Schweickert, L and Steinhauer, S and Yang, L and Zichi, J and Hammar, M and Jöns, Klaus D. and Zwiller, V}},
pages = {{173102}},
title = {{{A stable wavelength-tunable triggered source of single photons and cascaded photon pairs at the telecom C-band}}},
volume = {{112}},
year = {{2018}},
}
@inproceedings{41912,
author = {{Schweickert, L and Jöns, Klaus D. and Zeuner, K.D and Covre da Silva, S.F and Huang, H and Lettner, T and Reindl, M and Zichi, J and Trotta, R and Rastelli, A and Zwiller, V}},
pages = {{093106 }},
title = {{{On-demand generation of background-free single photons from a solid-state source,}}},
volume = {{112}},
year = {{2018}},
}
@inproceedings{41904,
author = {{Elshaari, A.W and Büyüközer, E and Esmaeil Zadeh, I and Lettner, T and Zhao, P and Schöll, E and Gyger, S and Reimer, M.E and Dalacu, D and Poole, P and Jöns, Klaus D. and Zwiller, V}},
number = {{12}},
pages = {{7969--7976}},
title = {{{Strain-tunable quantum integrated photonics}}},
volume = {{18}},
year = {{2018}},
}
@inproceedings{41903,
author = {{Reindl, M and Schubert, David and Schimpf, C and Covre da Silva, S.F and Rota, M.B and Huang, H and Zwiller, V and Jöns, Klaus D. and Rastelli, A and Trotta, R}},
number = {{12}},
pages = {{eaau1255 }},
title = {{{All-photonic quantum teleportation using on demand solid-state quantum emitters}}},
volume = {{4}},
year = {{2018}},
}
@inproceedings{41905,
author = {{Haffouz, S and Zeuner, K.D and Dalacu, D and Poole, P.J and Lapointe, J and Poitras, D and Mnaymneh, K and Wu, Xing and Couillard, M and Korkusinski, M and Schöll, E and Jöns, Klaus D. and Zwiller, V and Williams, R.L}},
number = {{5}},
pages = {{3047--3052}},
title = {{{Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide}}},
volume = {{18}},
year = {{2018}},
}
@inproceedings{8162,
abstract = {{The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.}},
author = {{Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}},
booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}},
editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}},
keywords = {{search complexity, local Hamiltonian, Quantum SAT, algebraic geometry}},
location = {{Liverpool, UK}},
pages = {{38:1--38:16}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{On Efficiently Solvable Cases of Quantum k-SAT}}},
doi = {{10.4230/LIPIcs.MFCS.2018.38}},
volume = {{117}},
year = {{2018}},
}
@inproceedings{8161,
abstract = {{The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of "unentanglement"), QMA(2) is strictly contained in NEXP.}},
author = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}},
booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}},
editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}},
keywords = {{Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity}},
location = {{Liverpool, UK}},
pages = {{58:1--58:16}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}},
doi = {{10.4230/LIPIcs.MFCS.2018.58}},
volume = {{117}},
year = {{2018}},
}
@inproceedings{8160,
abstract = {{An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a "query validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions.}},
author = {{Gharibian, Sevag and Yirka, Justin}},
booktitle = {{12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}},
editor = {{Wilde, Mark}},
keywords = {{Complexity theory, Quantum Merlin Arthur (QMA), local Hamiltonian, local measurement, spectral gap}},
location = {{Paris, France}},
pages = {{2:1--2:17}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{The Complexity of Simulating Local Measurements on Quantum Systems}}},
doi = {{10.4230/LIPIcs.TQC.2017.2}},
volume = {{73}},
year = {{2018}},
}
@article{8167,
author = {{Gharibian, Sevag and Sikora, Jamie}},
issn = {{1942-3454}},
journal = {{ACM Transactions on Computation Theory (TOCT)}},
keywords = {{Local Hamiltonian, ground state connectivity, quantum Hamiltonian complexity, reconfiguration problem}},
number = {{2}},
pages = {{8:1--8:28}},
publisher = {{ACM}},
title = {{{Ground State Connectivity of Local Hamiltonians}}},
doi = {{10.1145/3186587}},
volume = {{10}},
year = {{2018}},
}
@article{63740,
author = {{Wright, Thomas A. and Francis-Jones, Robert J. A. and Gawith, Corin B. E. and Becker, Jonas N. and Ledingham, Patrick M. and Smith, Peter G. R. and Nunn, Joshua and Mosley, Peter J. and Brecht, Benjamin and Walmsley, Ian A.}},
issn = {{2331-7019}},
journal = {{Physical Review Applied}},
number = {{4}},
publisher = {{American Physical Society (APS)}},
title = {{{Two-Way Photonic Interface for Linking the Sr+ Transition at 422 nm to the Telecommunication C Band}}},
doi = {{10.1103/physrevapplied.10.044012}},
volume = {{10}},
year = {{2018}},
}
@article{63739,
author = {{Kaczmarek, K. T. and Ledingham, P. M. and Brecht, Benjamin and Thomas, S. E. and Thekkadath, G. S. and Lazo-Arjona, O. and Munns, J. H. D. and Poem, E. and Feizpour, A. and Saunders, D. J. and Nunn, J. and Walmsley, I. A.}},
issn = {{2469-9926}},
journal = {{Physical Review A}},
number = {{4}},
publisher = {{American Physical Society (APS)}},
title = {{{High-speed noise-free optical quantum memory}}},
doi = {{10.1103/physreva.97.042316}},
volume = {{97}},
year = {{2018}},
}
@article{31268,
author = {{Faure, Frédéric and Weich, Tobias}},
issn = {{0010-3616}},
journal = {{Communications in Mathematical Physics}},
keywords = {{Mathematical Physics, Statistical and Nonlinear Physics}},
number = {{3}},
pages = {{755--822}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{Global Normal Form and Asymptotic Spectral Gap for Open Partially Expanding Maps}}},
doi = {{10.1007/s00220-017-3000-0}},
volume = {{356}},
year = {{2017}},
}
@article{31272,
author = {{Harris, Benjamin and Weich, Tobias}},
issn = {{0001-8708}},
journal = {{Advances in Mathematics}},
keywords = {{General Mathematics}},
pages = {{176--236}},
publisher = {{Elsevier BV}},
title = {{{Wave front sets of reductive Lie group representations III}}},
doi = {{10.1016/j.aim.2017.03.025}},
volume = {{313}},
year = {{2017}},
}
@article{31267,
author = {{Guillarmou, Colin and Hilgert, Joachim and Weich, Tobias}},
issn = {{0025-5831}},
journal = {{Mathematische Annalen}},
keywords = {{General Mathematics}},
number = {{3-4}},
pages = {{1231--1275}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{Classical and quantum resonances for hyperbolic surfaces}}},
doi = {{10.1007/s00208-017-1576-5}},
volume = {{370}},
year = {{2017}},
}
@inproceedings{41922,
author = {{Jöns, Klaus D. and Schweickert, L and Versteegh, M.A.M and Dalacu, D and Poole, P.J and Gulinatti, A and Giudice, A and Zwiller, V and Reimer, M.E}},
title = {{{Bright nanoscale source of deterministic entangled photon pairs violating Bell's inequality,}}},
volume = {{7}},
year = {{2017}},
}
@inproceedings{41914,
author = {{Elshaari, A.W and Esmaeil Zadeh, I and Fognini, A and Reimer, M. E and Dalacu, D and Poole, P.J and Zwiller, V and Jöns, Klaus D.}},
number = {{379}},
title = {{{On-chip single photon filtering and multiplexing in hybrid quantum photonic circuits}}},
volume = {{8}},
year = {{2017}},
}
@inproceedings{41913,
author = {{ Assali, S and Lähnemann, J and Vu, T.T.T and Jöns, Klaus D. and Gagliano, L and Verheijen, M.A and Akopian,, N and Bakkers, E.P.A.M and Haverkort, J,E.M}},
number = {{10}},
pages = {{6062--6068}},
title = {{{Crystal phase quantum well emission with digital control}}},
volume = {{17}},
year = {{2017}},
}
@inproceedings{41921,
author = {{Reindl, M and Jöns, Klaus D. and Schubert, David and Schimpf, C and Y Huo, Y and Zwiller, V and Trotta, R and Rastelli,, A}},
number = {{7}},
pages = {{4090--4095 }},
title = {{{Phonon-assisted two-photon interference from remote quantum emitters}}},
volume = {{17}},
year = {{2017}},
}