BEGIN:VCALENDAR
PRODID:-//AddEvent Inc//AddEvent.com v1.7//EN
VERSION:2.0
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20261101T010000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:We give an introduction to fermionic encoding schemes applicable in the context of quantum simulation of fermionic systems in condensed matter physics\, lattice gauge theories\, and in quantum chemistry.\n \nFor this we will focus on the circuit depth overhead for a variety of constructions of fermionic encodings\, more precisely in terms of their weight given by the choice of encoding within the Pauli group\, and as such also in terms of their circuit depth due to multi-qubit rotation gates.\n \nIn particular we will introduce the Fenwick tree encoding due to Bravyi and Kitaev\, as well as an optimal all-to-all encoding scheme in terms of ternary trees due to Jiang et al\, and put those in perspective with the well-known fermionic encoding given by the Jordan-Wigner transformation. Such encoding schemes of fermionic systems with all-to-all connectivity become relevant especially in the context of molecular simulation in quantum chemistry.\n \nWe then further discuss the encoding of the algebra of even fermionic operators\, which becomes particularly handy in the estimation of ground state energies for complex materials and their phase transitions in condensed matter physics.\n \nIn particular\, we will introduce here the so-called Bravyi--Kitaev superfast encoding for the algebra of even fermionic operators\, as well as the compact encoding due to Klassen and Derby as a particular variant thereof. These encoding schemes require the further use of stabilizer subspaces and so of fault-tolerant encoding schemes for their practical implementation for the purpose of quantum simulation. We then finish with a further improvement\, the so-called supercompact encoding\, due to Chen and Xu. In particular\, we will focus here on its code parameters (more precisely its encoding rate and code distance) and put those in perspective with the previous compact encoding due to Klassen and Derby.\n \nThis talk is meant as an expository talk on available encoding schemes for fermionic systems\, together with their best practices for the purpose of quantum simulations.
X-ALT-DESC;FMTTYPE=text/html:We give an introduction to fermionic encoding schemes applicable in the context of quantum simulation of fermionic systems in condensed matter physics, lattice gauge theories, and in quantum chemistry.<br /> <br />For this we will focus on the circuit depth overhead for a variety of constructions of fermionic encodings, more precisely in terms of their weight given by the choice of encoding within the Pauli group, and as such also in terms of their circuit depth due to multi-qubit rotation gates.<br /> <br />In particular we will introduce the Fenwick tree encoding due to Bravyi and Kitaev, as well as an optimal all-to-all encoding scheme in terms of ternary trees due to Jiang et al, and put those in perspective with the well-known fermionic encoding given by the Jordan-Wigner transformation. Such encoding schemes of fermionic systems with all-to-all connectivity become relevant especially in the context of molecular simulation in quantum chemistry.<br /> <br />We then further discuss the encoding of the algebra of even fermionic operators, which becomes particularly handy in the estimation of ground state energies for complex materials and their phase transitions in condensed matter physics.<br /> <br />In particular, we will introduce here the so-called Bravyi--Kitaev superfast encoding for the algebra of even fermionic operators, as well as the compact encoding due to Klassen and Derby as a particular variant thereof. These encoding schemes require the further use of stabilizer subspaces and so of fault-tolerant encoding schemes for their practical implementation for the purpose of quantum simulation. We then finish with a further improvement, the so-called supercompact encoding, due to Chen and Xu. In particular, we will focus here on its code parameters (more precisely its encoding rate and code distance) and put those in perspective with the previous compact encoding due to Klassen and Derby.<br /> <br />This talk is meant as an expository talk on available encoding schemes for fermionic systems, together with their best practices for the purpose of quantum simulations.
UID:1776576125addeventcom
SUMMARY:Fermionic encodings: BK superfast\, ternary trees\, and even fermionic encodings
DTSTART;TZID=America/New_York:20240501T120000
DTEND;TZID=America/New_York:20240501T130000
DTSTAMP:20260419T052205Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:QNC 1201
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
BEGIN:VALARM
TRIGGER:-PT60M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR