BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:5767@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20230127T140000
DTEND;TZID=Europe/Paris:20230127T170000
DTSTAMP:20241120T200212Z
URL:https://www.i2m.univ-amu.fr/evenements/premiere-rencontre-de-lanr-disq
 c/
SUMMARY:Rencontre (FRUMAM\, St Charles\, Marseille): Première Rencontre de
  l'ANR DisQC
DESCRIPTION:Rencontre: Rencontre dans le cadre de l'ANR DisQC\n\nCalcul Qua
 ntique Distribué : Algorithmes et Implémentations\n\nOrganisation : Benj
 amin Audoux (Groupe GDAC)\n\n\n\nMeeting in the frame of ANR DisQC\n\nDist
 ributed Quantum Computing : Algorithms and Implementations\nAlthough theor
 etically feasible\, quantum algorithms\, the highest layer of a distribute
 d quantum computing ecosystem\, is generally considered to be a long-term 
 topic. This is because of the common understanding that we will need to bu
 ild scalable implementations of universal quantum gate sets with high fide
 lity first\, and implement quantum error corrections (QEC) then\, in order
  to finally be able to run quantum algorithm on the thereby obtained unive
 rsal quantum computer. Unfortunately\, the current size of quantum compute
 r and the imperfect control over the quantum information processing places
  serious limitations on what quantum devices can achieve in the near term.
  Then in order to have reliable quantum computing is of importance to inve
 stigate accurate numerical schemes with high fidelity and to optimize circ
 uit size and depth. Quantum Walks (QW) and their generalisation\, Quantum 
 Cellular Automata (QCA)\, constitute a doubly strategic topic in this resp
 ect. First\, they have been used as a mathematical framework to express ma
 ny quantum algorithms. Secondly\, they constitute a promising architecture
  which naturally gives a degree of fault tolerance because of short range 
 interactions\, limiting error propagation. Strong interdisciplinary collab
 orations are needed to face the challenges of fault-tolerant quantum compu
 ting and to gain better knowledge on how to get there. The project intends
  to bring together scientific experts from the disciplines of quantum comp
 uting and distributed algorithms to work together towards the common goal 
 of 1) exploring and exploiting further synergies between these fields\, 2)
  understanding how distributed quantum computation interacts with noisy-in
 termediate-scale quantum hardware\, 3) identifying progressive strategies 
 and methods to design full fault-tolerant quantum algorithms\, and 4) deve
 loping new ideas for implementing quantum algorithms on distributed archit
 ecture.\n&nbsp\;\n\n&nbsp\;
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 021/10/image_agt-hal-01066619-quantum_codes-unknot_diagram-p.11-Audoux-500
 x112-1.jpg
CATEGORIES:Manifestation scientifique,Rencontre(s)
LOCATION:Saint-Charles - FRUMAM  (2ème étage)\, 3 Place Victor Hugo\, Mar
 seille\, 13003\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=3 Place Victor Hugo\, Marse
 ille\, 13003\, France;X-APPLE-RADIUS=100;X-TITLE=Saint-Charles - FRUMAM  (
 2ème étage):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20221030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR