Agenda
février
-
11:0012:00
In order to further develop the theory of packing trees and packing forests in an undirected graph, we extended the notion of supermodular functions on sets to supermodular functions on partitions. This allowed us to prove the augmentation version of the seminal result of Nash-Williams and Tutte, and to extend it to hypergraphs.
(Pierre Hoppenot) [G-SCOP, Grenoble INP, Université Grenoble Alpes]
Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres | https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres ]
Remarks / Remarques
Find all the information of the working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] .
Retrouvez toutes les informations du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT | page web ] .FrançaisLaBRI/178 -
10:4511:45
Tensor networks (TNs) offer powerful algorithms for simulating quantum systems, but struggle to represent states with high entanglement. In contrast, quantum computers naturally accommodate entanglement, though developing efficient quantum algorithms remains an active area of research. Integrating TNs with quantum computing has emerged as a promising strategy to overcome limitations inherent to both classical and quantum approaches. In this talk, we will cover two examples of hybrid TN/quantum algorithms. First, we demonstrate how TNs can enhance the simulation of quantum dynamics on noisy quantum devices. In particular, we use a TN algorithm to compress quantum circuits and show that this approach significantly reduces noise requirements to reach a practical advantage on noisy hardware. Second, we explore how TNs can assist in preparing approximate ground states on quantum computers by optimizing parameterized quantum circuits. We show that carefully selecting TN algorithms enables scaling to large qubit systems and that pre-optimizing circuits offers a promising strategy to avoid barren plateaus by providing warm-start initialization. Finally, we analyze the classical simulation costs of this approach and identify scenarios where quantum computers exhibit favorable scaling.
FrançaisRoom 178 -
14:0015:00
TBA
FrançaisLaBRI -
14:3015:30
We could expect the first large-scale fault-tolerant quantum computers to be few in number and only accessible to the masses via some sort of cloud service, where users would send computing tasks to remote quantum computers. Under the common belief that quantum computers will be more powerful than classical ones (i.e., that BPP is strictly contained in BQP), this raises the following question : if a quantum computer can efficiently perform a computation that a classical computer cannot, can the classical computer at least efficiently verify its result? Over the years, many techniques have been developed to make delegated quantum computations verifiable classically, using interaction and various assumptions. Notable examples include the protocols of Aharonov, Ben-Or, Eban and Mahadev ( [ https://arxiv.org/abs/1704.04487 | https://arxiv.org/abs/1704.04487 ] ), Broadbent, Fitzsimons and Kashefi ( [ https://arxiv.org/abs/0807.4154 | https://arxiv.org/abs/0807.4154 ] ), and Mahadev ( [ https://arxiv.org/abs/1804.01082 | https://arxiv.org/abs/1804.01082 ] ). However, none of these techniques are known to relativize to oracle problems, some of which provably separate BPP and BQP and aren't trivially verifiable by a classical agent.
In this talk, I will introduce the first ever protocols for some of these oracle problems, namely Simon's problem and the Forrelation problem, by adapting known verification techniques in novel ways. I will also discuss the possibility of the existence of an oracle problem that is efficiently solvable by a quantum computer, but for which there couldn't exist a verification protocol between a quantum prover and a classical verifier. This talk is based on results from my PhD thesis, which are yet unpublished.
FrançaisOn Zoom -
13:0014:00FrançaisLaBRI, salle 178
-
09:0010:00
Most of the quantum algorithms have been developed using a finite set of universal quantum gates, which allows for an easy decomposition of any unitary transformation. However, this set of gates includes entangling two-body gates. In the current context of faulty devices, the near-term noisy intermediate-scale quantum era, implementing these gates is deemed costly, both because the time requirement to implement these operations is much larger than for the single-qubit gates, and because they are more susceptible to errors. In contrast to the digital paradigm, analog quantum computers do not allow for arbitrary operations. But in turn of its lack of flexibility, analog devices excel in their robustness and resilience against noise.
In this context, digital-analog quantum computing (DAQC) was proposed as a way of taking advantage of the robustness of analog quantum computers while maintaining the flexibility of digital quantum computing. For this, this paradigm employs the natural interaction Hamiltonian of the devices as a resource for the entangling operations. Then, universality can be reached by the application of arbitrary single qubit gates. This allows us to implement any desired operation without the need of employing expensive and noisy two-qubit gates.
Here I present the contributions to the state of the art made during my PhD. In particular, I will describe the solution to one of the main challenges of DAQC, that was achieving universality employing efficient constructive methods. While optimal DAQC protocols require tackling an NP-Hard problem, we have proposed suboptimal protocols which only require polynomial classical resources to be calculated. In addition to this, we further studied its noise resilience, and introduced error mitigation techniques specifically designed for this paradigm. We further continued on the implementation of various algorithms and simulation tasks, showing the possibility that DAQC offers a valid alternative which in some cases might provide advantages in their run-time or fidelity.
FrançaisLaBRI