Ciclo di seminari
Forward and Backward Constrained Bisimulations for Quantum Circuits
Programma
I curatori del ciclo LiMoSP - Linguaggi e Modelli per il Software e le sue Proprietà sono lieti di invitarvi al seminario intitolato "Forward and Backward Constrained Bisimulations for Quantum Circuits" che sarà tenuto dal Prof. Mirco Tribastone di IMT Lucca.
Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. We discuss lumping methods based on bisimulation, an established class of techniques that has been proven successful for (classic) stochastic and deterministic systems such as Markov chains and ordinary differential equations. Forward constrained bisimulation yields a lower-dimensional model which exactly preserves quantum measurements projected on a linear subspace of interest. Backward constrained bisimulation gives a reduction that is valid on a subspace containing the circuit input, from which the circuit result can be fully recovered. We provide an algorithm to compute the constrained bisimulations yielding coarsest reductions in both cases, using a duality result relating the two notions. As applications, we provide theoretical bounds on the size of the reduced state space for well-known quantum algorithms for search, optimization, and factorization. Using a prototype implementation, we report significant reductions on a set of benchmarks. Furthermore, we show that constraint bisimulation complements state-of-the-art methods for the simulation of quantum circuits based on decision diagrams.
Il seminario si svolgerà in presenza, ma sarà anche possibile seguirlo a distanza collegandosi a: https://meet.google.com/yeg-smzk-qzd
Dettagli sull'evento
Data e luogo
Inizio: 28/11/2024
alle ore 16:00
Fine: 28/11/2024
alle ore 18:00
Collegio Raffaello (Urbino, Piazza della Repubblica, 13) Aula Turing
Organizzato e promosso da:
LiMoSP - Linguaggi e Modelli per il Software e le sue Proprietà
