BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.talentq.es/es_es
X-WR-CALDESC:Eventos para 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Madrid
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20270328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20271031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Madrid:20260512T160000
DTEND;TZID=Europe/Madrid:20260512T170000
DTSTAMP:20260512T020407
CREATED:20260506T082414Z
LAST-MODIFIED:20260506T082414Z
UID:2238-1778601600-1778605200@www.talentq.es
SUMMARY:Seminar | Vicente P. Soloviev & Jacobo Padín
DESCRIPTION:Title: Pauli Correlation Encoding for Scalable Quantum Optimization: Analysis\, constraints\, and use cases\n\n \n\nSpeakers: Vicente P. Soloviev (Principal Researcher) and Jacobo Padin Martinez (Quantum Computing Scientist)\n\n \n\nAbstract: Advances in quantum computing are opening new opportunities for solving complex optimization problems that challenge classical methods\, especially in finance. This webinar presents two complementary lines of research that push the boundaries of quantum optimization in realistic settings. First\, we show how a gate‑based variational quantum algorithm can be applied to large‑scale portfolio optimization by assigning multiple assets to each qubit using Pauli Correlation Encoding (PCE). This enables the treatment of portfolios with more than 250 variables—far beyond the limits of conventional one‑hot encodings—by clustering highly correlated assets and optimizing them through a hybrid quantum–classical workflow.\n\n \n\nBuilding on this\, we explore how PCE can be extended to general constrained combinatorial optimization problems. While standard PCE struggles to enforce constraints reliably\, we introduce an Iterative‑PCE method that significantly improves solution quality and constraint satisfaction across a wide range of problem sizes.\n\n \n\nTogether\, these results demonstrate both the challenges and the promise of PCE‑based techniques\, highlighting scalable strategies for applying gate‑based quantum algorithms to meaningful real‑world optimization tasks in the NISQ era.\n\n \n\nRegistration: https://events.teams.microsoft.com/event/5a04ea97-3a2c-4689-97d5-c4a3c16a1ff0@8f0d452c-b7a4-4964-b810-8c397374477b
URL:https://www.talentq.es/es_es/evento/seminar-vicente-p-soloviev-jacobo-padin/
ATTACH;FMTTYPE=image/png:https://www.talentq.es/wp-content/uploads/2026/05/pauli_correlation_encoding_for_scalable_quantum_optimization_analysis_constraints_and_use_cases_talentq.png
END:VEVENT
END:VCALENDAR