BEGIN:VCALENDAR VERSION:2.0 PRODID:-//DATE2026//date-conference.com//EN CALSCALE:GREGORIAN METHOD:PUBLISH BEGIN:VEVENT DTSTART;TZID=Europe/Rome:20260421T163000 DTEND;TZID=Europe/Rome:20260421T180000 LOCATION:Room Rigoletto CREATED:20260421T174602 DTSTAMP:20260421T174602 SUMMARY:ET02 Quantum Circuit Compilation And Optimisation URL;VALUE=URI:https://date26date-conference.com/programme#ET02 BEGIN:VALARM TRIGGER:-PT15M ACTION:DISPLAY DESCRIPTION:Reminder END:VALARM DESCRIPTION:Get the latest session information at https://date26date-conference.com/programme#ET02\n\n\nAbout:\n \n This tutorial provides a comprehensive overview of quantum circuit optimization, beginning with the foundational principles of classical reversible circuit synthesis and optimization. It then progresses to the core challenges of quantum compilation, detailing the complete pipeline of unitary synthesis, qubit routing, and gate optimization. The presentation evaluates different strategies, contrasting exact versus approximate compilation techniques and exploring the use of machine learning in solving these NP-hard problems. The last portion is dedicated to the practical demands of fault tolerance, examining the trade-offs between compute and different storage strategies.\n \n The tutorial is presented through a series of python notebooks that use Cirq, and Qualtran to demonstrate the concepts.\n \n Speakers:\n \n - Noureldin Yosri, Google Quantum AI, USA\n - [Dmitri Maslov](https://scholar.google.com/citations?user=tCzt7q4AAAAJ&hl=en)\n \n Target Audience:\n \n Academics and professionals looking for an introduction and overview of quantum circuit compilation.\n \n Learning objectives:\n \n - An introduction to cost models of quantum circuits\n - An introduction to circuit compilation, gatesets and routing.\n - An introduction to circuit optimization techniques.\n - An introduction to fault tolerance concepts such as error correction, magic states and memory models.\n \n Required Background:\n \n Basic quantum computing concepts such as states, entanglement, unitaries, the bra-ket notation and circuits.\n \n --------------------------------------------------------------- X-ALT-DESC;FMTTYPE=text/html:

Get the latest session information at https://date26date-conference.com/programme#ET02

About:

This tutorial provides a comprehensive overview of quantum circuit optimization, beginning with the foundational principles of classical reversible circuit synthesis and optimization. It then progresses to the core challenges of quantum compilation, detailing the complete pipeline of unitary synthesis, qubit routing, and gate optimization. The presentation evaluates different strategies, contrasting exact versus approximate compilation techniques and exploring the use of machine learning in solving these NP-hard problems. The last portion is dedicated to the practical demands of fault tolerance, examining the trade-offs between compute and different storage strategies. 

The tutorial is presented through a series of python notebooks that use Cirq, and Qualtran to demonstrate the concepts.

Speakers:

Target Audience:

Academics and professionals looking for an introduction and overview of quantum circuit compilation.

Learning objectives:

Required Background:

Basic quantum computing concepts such as states, entanglement, unitaries, the bra-ket notation and circuits.

UID:DATE-ET02-20260421T163000-20260421T180000 END:VEVENT BEGIN:VTIMEZONE TZID:Europe/Rome TZURL:http://tzurl.org/zoneinfo/Europe/Rome X-LIC-LOCATION:Europe/Rome BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19810329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CEST DTSTART:19961027T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD BEGIN:STANDARD TZOFFSETFROM:-001444 TZOFFSETTO:+0000 TZNAME:WET DTSTART:19010101T000000 RDATE:19010101T000000 END:STANDARD END:VTIMEZONE END:VCALENDAR