No. |
Title |
Author |
Year |
---|

1 |
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications |
Le Gall, François et al. |
2023 |

2 |
Distributed Quantum Interactive Proofs |
Le Gall, François et al. |
2023 |

3 |
Improved Hardness Results for the Guided Local Hamiltonian Problem |
Cade, Chris et al. |
2023 |

4 |
An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes |
Hasegawa, Atsuya et al. |
2022 |

5 |
Brief Announcement: Distributed Quantum Interactive Proofs |
Le Gall, François et al. |
2022 |

6 |
Front Matter, Table of Contents, Preface, Conference Organization |
Le Gall, François et al. |
2022 |

7 |
LIPIcs, Volume 232, TQC 2022, Complete Volume |
Le Gall, François et al. |
2022 |

8 |
Quantum Distributed Algorithms for Detection of Cliques |
Censor-Hillel, Keren et al. |
2022 |

9 |
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems |
Le Gall, François et al. |
2022 |

10 |
Distributed Quantum Proofs for Replicated Data |
Fraigniaud, Pierre et al. |
2021 |

11 |
Lower Bounds for Induced Cycle Detection in Distributed Computing |
Le Gall, François et al. |
2021 |

12 |
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption |
Hasegawa, Atsuya et al. |
2021 |

13 |
Quantum Logarithmic Space and Post-Selection |
Le Gall, François et al. |
2021 |

14 |
Test of Quantumness with Small-Depth Quantum Circuits |
Hirahara, Shuichi et al. |
2021 |

15 |
Brief Announcement: Distributed Quantum Proofs for Replicated Data |
Fraigniaud, Pierre et al. |
2020 |

16 |
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs |
Censor-Hillel, Keren et al. |
2020 |

17 |
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model |
Izumi, Taisuke et al. |
2020 |

18 |
Quantum-Inspired Classical Algorithms for Singular Value Transformation |
Jethwani, Dhawal et al. |
2020 |

19 |
Average-Case Quantum Advantage with Shallow Circuits |
Le Gall, François |
2019 |

20 |
Quantum Advantage for the LOCAL Model in Distributed Computing |
Le Gall, François et al. |
2019 |

21 |
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups |
Le Gall, François et al. |
2018 |

22 |
Multiparty Quantum Communication Complexity of Triangle Finding |
Le Gall, François et al. |
2018 |

23 |
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers |
Doron, Dean et al. |
2017 |

24 |
Quantum Communication Complexity of Distributed Set Joins |
Jeffery, Stacey et al. |
2016 |

25 |
Generalized Quantum Arthur-Merlin Games |
Kobayashi, Hirotada et al. |
2015 |

26 |
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem |
Le Gall, François |
2010 |

27 |
Efficient Isomorphism Testing for a Class of Group Extensions |
Le Gall, Francois |
2009 |