BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Lluis Masanes (London Centre for Nanotechnology) DTSTART:20240305T150000Z DTEND:20240305T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/1 DESCRIPTION:Title: Conformal Quantum Cellular Automata\nby Lluis Masanes (London Centre f or Nanotechnology) as part of Quantum Spain\n\n\nAbstract\nFirst\, I will motivate the use of unitary circuits in quantum many-body physics. Second\ , I will introduce a family of quantum callular automata in 1+1 dimensions consisting of dual-unitary circuits. The symmetry of these QCAs is a disc rete version of the conformal group\, hence\, these models inheritate many features of conformal field theory. With the same dual unitaries I will c onstruct tensor-network states and interpret them as spatial slices of cur ved 2+1 discrete geometries. The QCA induces a dynamics on these (bulk) ge ometries which reproduces gravitational phenomena like gravitational time dilation\, the formation of black holes and the growth of their throat.\n LOCATION:https://researchseminars.org/talk/TalentQ/1/ END:VEVENT BEGIN:VEVENT SUMMARY:Laura Schulz (Leibniz Supercomputing Centre) DTSTART:20240409T140000Z DTEND:20240409T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/2 DESCRIPTION:Title: Quantum-Accelerated Supercomputing: Where we are and where we need to go.< /a>\nby Laura Schulz (Leibniz Supercomputing Centre) as part of Quantum Sp ain\n\n\nAbstract\nQuantum computing is a breakthrough science and technol ogy star\, but its true power lies in partnering with supercomputing. In t his presentation\, I’ll highlight LRZ’s multi-dimensional efforts to p rovide\, merge and optimize various quantum accelerators into HPC workflow s and into HPC centers. This includes insights into the development of the Munich Quantum Software Stack and its mission to compute with hybrid HPC- QC using multiple quantum systems. I’ll discuss where we are at this poi nt in time with quantum computing and what hurdles (we know about) now to overcome to get where we need to go next.\n LOCATION:https://researchseminars.org/talk/TalentQ/2/ END:VEVENT BEGIN:VEVENT SUMMARY:Zoë Holmes (EPFL) DTSTART:20240507T140000Z DTEND:20240507T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/3 DESCRIPTION:Title: Does provable absence of barren plateaus imply classical simulability? \nby Zoë Holmes (EPFL) as part of Quantum Spain\n\n\nAbstract\nA large am ount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article\, we face the increasingly loud e lephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barr en plateaus also be leveraged to efficiently simulate the loss classically ? We present strong evidence that commonly used models with provable absen ce of barren plateaus are also classically simulable\, provided that one c an collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality\, and that current approaches for s olving them end up encoding the problem into some small\, classically simu lable\, subspaces. This sheds serious doubt on the non-classicality of the information processing capabilities of parametrized quantum circuits for barren plateau-free landscapes and on the possibility of superpolynomial a dvantages from running them on quantum hardware. We end by discussing cave ats in our arguments\, the potential of smart initializations\, and by hig hlighting new opportunities that our perspective raises.\n LOCATION:https://researchseminars.org/talk/TalentQ/3/ END:VEVENT BEGIN:VEVENT SUMMARY:Michael Vasmer (Xanadu) DTSTART:20240521T140000Z DTEND:20240521T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/4 DESCRIPTION:Title: Quantum error correction with constant time overhead\nby Michael Vasme r (Xanadu) as part of Quantum Spain\n\n\nAbstract\nThe promise of quantum computers is currently limited by noise. Quantum error correction has the potential to overcome this problem\, at the cost of large space and time o verheads. The usual approach to diagnose errors in a quantum error-correct ing code is to measure certain parity-check operators. These outcomes are then processed by a classical algorithm (a decoder) to find a recovery ope rator that corrects the errors. In most cases it is necessary to do many r ounds of parity-check measurements as part of the error correction procedu re\, resulting in a large time overhead. In this talk I will give an intro duction to quantum error correction and the decoding problem and then disc uss a family of quantum error-correcting codes that only require a single round of parity-check measurements to do reliable error correction.\n LOCATION:https://researchseminars.org/talk/TalentQ/4/ END:VEVENT BEGIN:VEVENT SUMMARY:Javier Robledo (IBM) DTSTART:20240604T140000Z DTEND:20240604T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/5 DESCRIPTION:Title: Chemistry Beyond Exact Solutions on a Quantum-Centric Supercomputer\nb y Javier Robledo (IBM) as part of Quantum Spain\n\n\nAbstract\nA universal quantum computer can be used as a simulator capable of predicting propert ies of diverse quantum systems. Electronic structure problems in chemistry offer practical use cases around the hundred-qubit mark. This appears pro mising since current quantum processors have reached these sizes. However\ , mapping these use cases onto quantum computers yields deep circuits\, an d for for pre-fault-tolerant quantum processors\, the large number of meas urements to estimate molecular energies leads to prohibitive runtimes. As a result\, realistic chemistry is out of reach of current quantum computer s in isolation. A natural question is whether classical distributed comput ation can relieve quantum processors from parsing all but a core\, intrins ically quantum component of a chemistry workflow. In this seminar\, I will discuss the incorporation of quantum computations of chemistry in a quant um-centric supercomputing architecture\, using up to 6400 nodes of the sup ercomputer Fugaku to assist a Heron superconducting quantum processor. We simulate the N2 triple bond breaking in a correlation-consistent cc-pVDZ b asis set\, and the active-space electronic structure of [2Fe–2S] and [4F e–4S] clusters\, using 58\, 45 and 77 qubits respectively\, with quantum circuits of up to 10570 (3590 2-qubit) quantum gates.\n LOCATION:https://researchseminars.org/talk/TalentQ/5/ END:VEVENT BEGIN:VEVENT SUMMARY:Antonio Rubio (ICFO) DTSTART:20240611T140000Z DTEND:20240611T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/6 DESCRIPTION:Title: QUIONE: A quantum simulator based on ultracold strontium atoms\nby Ant onio Rubio (ICFO) as part of Quantum Spain\n\n\nAbstract\nNeutral atoms ha ve a wide range of applications in quantum science and technology. Stronti um atoms\, in particular\, are popular for their use as atomic clocks in t he field of quantum metrology. But recently\, their preparation in optical lattices and tweezers has also been exploited for quantum simulation and quantum computing. In this talk I will present QUIONE: an analog quantum s imulator able to detect individual strontium atoms. The experiment\, built at ICFO\, constitutes the first strontium quantum-gas microscope. This me ans that we can prepare quantum-degenerate gases in an optical lattice and detect them with single-site resolution. By using a bosonic isotope\, we can realize the Bose-Hubbard model and use our microscope to prepare and d etect superfluid phases of matter. Finally\, I will also show that\, by sw itching to a different isotope of strontium\, we can prepare fermionic gas es\, and will soon allow us to study the exotic phases of the SU(N) Hubbar d model.\n\nhttps://www.talentq.es/es_es/evento/talentq-seminar-antonio-ru bio-postdoctoral-researcher-at-icfo/\n LOCATION:https://researchseminars.org/talk/TalentQ/6/ END:VEVENT BEGIN:VEVENT SUMMARY:Henry Semenenko (Quantinuum) DTSTART:20240625T140000Z DTEND:20240625T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/7 DESCRIPTION:Title: Quantum Error Correction and Scaling with Trapped-Ions\nby Henry Semen enko (Quantinuum) as part of Quantum Spain\n\nAbstract: TBA\n\nQuantinuum' s quantum processors use the quantum charge-coupled device (QCCD) architec ture with trapped-ion qubits to deliver leading performance with high-fide lity gates and all-to-all connectivity. As we look towards performing more complex algorithms that require vast numbers of operations\, it will be n ecessary to develop quantum error correction (QEC) to reduce error below t he physical level. Recent QEC results using Quantinuum's processors have d emonstrated logical error rates significantly below the physical level sig nifying a transition towards reliable quantum computing. This talk will pr ovide an overview of the QCCD trapped-ion architecture\, present QEC resul ts demonstrating better-than-physical error rates\, and discuss the future scaling of Quantinuum's processors.\n LOCATION:https://researchseminars.org/talk/TalentQ/7/ END:VEVENT BEGIN:VEVENT SUMMARY:Esperanza Cuenca (NVIDIA) DTSTART:20240709T140000Z DTEND:20240709T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/8 DESCRIPTION:Title: Programming Heterogenous Quantum-Classical Supercomputing Architectures\nby Esperanza Cuenca (NVIDIA) as part of Quantum Spain\n\n\nAbstract\nVa luable quantum computing will integrate tightly with and depend on classic al high-performance computing and AI. Such a hybrid system needs a program ming model that enables easy and performant co-programming across quantum and classical resources. NVIDIA CUDA-Q is an open-source platform for inte grating and programming QPUs\, GPUs\, and CPUs in a single system. Additio nally\, the ability of scientists\, developers\, and researchers to simula te quantum circuits on classical computers is vital for quantum computing. NVIDIA cuQuantum is an SDK for accelerating quantum circuit simulation. B uilt to accelerate all circuit simulation frameworks and integrated into C UDA-Q and more\, cuQuantum allows simulations of ideal or noisy qubits wit h scale and performance. During this talk CUDA-Q main features will be pre sented\, as well as some representative works.\n LOCATION:https://researchseminars.org/talk/TalentQ/8/ END:VEVENT BEGIN:VEVENT SUMMARY:Alejandro Gómez (IQM Quantum Computers) DTSTART:20240910T140000Z DTEND:20240910T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/9 DESCRIPTION:Title: Towards quantum advantage on the cloud: benchmarking a 20 qubit quantum co mputer\nby Alejandro Gómez (IQM Quantum Computers) as part of Quantum Spain\n\n\nAbstract\nQuantum computing is a field with incredible potenti al to solve fundamental limitations of classical computing\, as well as pr ovide a way for scientists to simulate complex quantum systems. Current te chnological implementations require further improvements in quality and sc alability in order for the field to reach its full potential. IQM Quantum Computers has developed universal gate-based QPUs\, based on superconducti ng technology\, as an approach to scale up towards practical quantum advan tage. This seminar will provide an overview of the architectures and techn ologies being developed at IQM Quantum Computers\, with a focus on the rec ently published benchmarks of IQM Garnet\, our cloud-accessible 20 qubit q uantum computer.\n LOCATION:https://researchseminars.org/talk/TalentQ/9/ END:VEVENT BEGIN:VEVENT SUMMARY:Pablo Bermejo DTSTART:20240924T140000Z DTEND:20240924T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/10 DESCRIPTION:Title: Quantum Convolutional Neural Networks are (Effectively) Classically Simul able\nby Pablo Bermejo as part of Quantum Spain\n\n\nAbstract\nQuantum Convolutional Neural Networks (QCNNs) are widely regarded as a promising model for Quantum Machine Learning (QML). In this work we tie their heuris tic success to two facts. First\, that when randomly initialized\, they ca n only operate on the information encoded in low-bodyness measurements of their input states. And second\, that they are commonly benchmarked on "lo cally-easy'' datasets whose states are precisely classifiable by the infor mation encoded in these low-bodyness observables subspace. We further show that the QCNN's action on this subspace can be efficiently classically si mulated by a classical algorithm equipped with Pauli shadows on the datase t. Indeed\, we present a shadow-based simulation of QCNNs on up-to 1024 qu bits for phases of matter classification. Our results can then be understo od as highlighting a deeper symptom of QML: Models could only be showing h euristic success because they are benchmarked on simple problems\, for whi ch their action can be classically simulated. This insight points to the f act that non-trivial datasets are a truly necessary ingredient for moving forward with QML. To finish\, we discuss how our results can be extrapolat ed to classically simulate other architectures.\n LOCATION:https://researchseminars.org/talk/TalentQ/10/ END:VEVENT BEGIN:VEVENT SUMMARY:Richard Kueng DTSTART:20241008T140000Z DTEND:20241008T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/11 DESCRIPTION:Title: Classical shadows in theory\, numerics and experiment\nby Richard Kue ng as part of Quantum Spain\n\n\nAbstract\nClassical shadows are a scalabl e way to extract meaningful information from a n-qubit system in a scalabl e and online fashion. Crucially\, this method has the potential to overcom e bottlenecks that plague more traditional general-purpose readout protoco ls. We will review the overall idea and then present numerical simulations (in silico) and experimental implementations (in vitro) of classical shad ows on existing quantum hardware.\n LOCATION:https://researchseminars.org/talk/TalentQ/11/ END:VEVENT BEGIN:VEVENT SUMMARY:Roberta Zambrini DTSTART:20241022T140000Z DTEND:20241022T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/12 DESCRIPTION:Title: Reservoir computing with complex quantum systems\nby Roberta Zambrini as part of Quantum Spain\n\n\nAbstract\nNon-conventional computing inspir ed by the brain\, or neuromorphic computing\, is a successful approach in a broad spectrum of applications\, and in the last few years proposals of Quantum Reservoir Computing have been explored. Quantum physical reservoir s have the potential to boost the processing performance in temporal tasks by exploiting quantum coherence\, not requiring error correction and not suffering optimization limitations. Furthermore this approach is naturally suited for fully quantum information processing (with quantum inputs). In this talk we will briefly review the state of the art and focus on recent results exploring the potential of different platforms and operation regi mes\, the role of quantum coherence and entanglement\, and how to overcome the challenges of real-time quantum reservoir computing.\n LOCATION:https://researchseminars.org/talk/TalentQ/12/ END:VEVENT BEGIN:VEVENT SUMMARY:Maria Schuld (Xanadu) DTSTART:20241105T150000Z DTEND:20241105T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/13 DESCRIPTION:Title: But why would we use quantum computers after all? Approaching Quantum Mac hine Learning a little differently\nby Maria Schuld (Xanadu) as part o f Quantum Spain\n\n\nAbstract\nThe last years of research in quantum machi ne learning have taught us a lot. There are problems where quantum compute rs have a provable advantage for learning (just apply Shor somewhere!). Tr aining variational "quantum neural networks" is a matter of a few lines of code\, but you need to be careful not to be dequantized\, and the results are a little disappointing. We all hope that things look better for "quan tum data". And a lot has been written about barren plateaus. But why\, on earth\, should we use quantum computers for machine learning at all? It se ems that we have not come any closer to answering this question. In this i nformal talk based on arXiv2409.00172\, I suggest a slightly different app roach to QML: One where we stare hard at a famous family of quantum algori thms\, try to understand why they work (not when they are faster) and muse how this could be turned into a learning principle. Expect no speedup and no end-to-end learning algorithm\, but a lot of educated speculation.\n LOCATION:https://researchseminars.org/talk/TalentQ/13/ END:VEVENT BEGIN:VEVENT SUMMARY:Marco Cerezo (LANL) DTSTART:20241119T150000Z DTEND:20241119T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/14 DESCRIPTION:Title: Is Quantum Machine Learning an ill-defined framework?\nby Marco Cerez o (LANL) as part of Quantum Spain\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/TalentQ/14/ END:VEVENT BEGIN:VEVENT SUMMARY:Diego Andrade (UDC) DTSTART:20241203T150000Z DTEND:20241203T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/15 DESCRIPTION:Title: Benchmarking Quantum Computers: The NEASQC Benchmark Suite (TNBS) case\nby Diego Andrade (UDC) as part of Quantum Spain\n\n\nAbstract\nBenchmar king Quantum Computers is required to objectively evaluate these platforms ' performance\, stressing their capabilities and leading the evolution of the hardware platforms. Some approaches work at the hardware level and are not necessarily linked to any practical application\, others are based on representative real-world use cases of this technology. This seminar will introduce the attendees to the topic of benchmarking Quantum Computers. T hen\, we will focus on our approach “The NEASQC Benchmark Suite (TNBS) ”\, an application-driven approach designed to measure the speed and acc uracy of quantum platforms when executing representative workloads. We wil l also introduce the audience to its code repository and main support docu ments.\n LOCATION:https://researchseminars.org/talk/TalentQ/15/ END:VEVENT BEGIN:VEVENT SUMMARY:Vedran Dunjko (Leiden University) DTSTART:20241217T150000Z DTEND:20241217T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/16 DESCRIPTION:Title: Topics in quantum topological data analysis\nby Vedran Dunjko (Leid en University) as part of Quantum Spain\n\n\nAbstract\nAlthough still argu ably an emerging field in classical machine learning\, topological data an alysis has already raised substantial interest from the perspective of qua ntum algorithms in the last few years\, and for good reasons. In this talk we will explain why this is the case. \nWe will introduce the topic of to pological data analysis and discuss the state-of-art of quantum algorithms for computational problems in TDA - this will include the problems of est imating the so-called Betti numbers and the problems of deciding pursuance of topological features in data. We will address their promises and limit ations\, possible generalizations and connections to many-body physics.\n LOCATION:https://researchseminars.org/talk/TalentQ/16/ END:VEVENT BEGIN:VEVENT SUMMARY:Andrew Lucas (University of Colorado Boulder) DTSTART:20250128T160000Z DTEND:20250128T170000Z DTSTAMP:20260422T225718Z UID:TalentQ/17 DESCRIPTION:Title: Low-density parity-check codes as stable phases of quantum matter\nby Andrew Lucas (University of Colorado Boulder) as part of Quantum Spain\n\ n\nAbstract\nPhases of matter with robust ground-state degeneracy\, such a s the quantum toric code\, are known to be capable of robust quantum infor mation storage. Here\, we address the converse question: given a quantum e rror correcting code\, when does it define a stable gapped quantum phase o f matter\, whose ground state degeneracy is robust against perturbations i n the thermodynamic limit? An affirmative answer to this question could al low us to leverage techniques from quantum error correction to learn new t hings about quantum statistical mechanics. We have proved that a low-densi ty parity-check (LDPC) code defines such a phase\, robust against all few- body perturbations\, if its code distance grows at least logarithmically i n the number of degrees of freedom\, and it exhibits a property that we ca ll "check soundness". Many constant-rate quantum LDPC expander codes have such properties\, and define stable phases of matter with a constant zero- temperature entropy density\, violating the third law of thermodynamics. O ur results also show that quantum toric code phases are robust to spatiall y nonlocal few-body perturbations.  I will conclude with potential applic ations for our ideas in condensed matter physics.\n LOCATION:https://researchseminars.org/talk/TalentQ/17/ END:VEVENT BEGIN:VEVENT SUMMARY:Almudena Carrera (IBM) DTSTART:20250211T150000Z DTEND:20250211T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/18 DESCRIPTION:Title: Combining quantum processors with real-time classical communication\n by Almudena Carrera (IBM) as part of Quantum Spain\n\n\nAbstract\nMany app lications of quantum computing require more connectivity than the planar l attice offered by the hardware on more qubits than is available on a singl e quantum processing unit (QPU). In this work\, we address both challenges by linking two QPUs in real time via a classical channel\, effectively un ifying them into a single\, larger-scale quantum computer. We demonstrate error-mitigated dynamic circuits and circuit cutting across two 127-qubit processors\, creating quantum states spanning up to 142 qubits and achievi ng a periodic connectivity that exceeds what one QPU alone can offer.\nIn this talk\, I will discuss the experimental methods behind these results\, emphasizing both the conceptual and practical aspects of circuit cutting. I will also compare two different approaches—one without classical comm unication and one with real-time classical communication—and explore how each affects the feasibility of this technique.\n LOCATION:https://researchseminars.org/talk/TalentQ/18/ END:VEVENT BEGIN:VEVENT SUMMARY:Davide Rusca (VQCC - University of Vigo) DTSTART:20250225T150000Z DTEND:20250225T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/19 DESCRIPTION:Title: uantum Randomness: From Theory to Experiment\nby Davide Rusca (VQCC - University of Vigo) as part of Quantum Spain\n\n\nAbstract\nRandomness se ems like a straightforward concept\, both intuitively and mathematically. However\, this confidence wavers when we consider the physical nature of r eality. A simple classical description of the world suggests that everythi ng\, no matter how chaotic\, is ultimately deterministic. Few would guess that the only way to truly reintroduce randomness into nature is through q uantum mechanics\, where the probabilistic nature of measurement outcomes is intrinsic to the theory. But how can we observe this in a lab? How can we harness these properties of nature to generate true randomness? In this talk\, we will explore the history of Quantum Random Number Generators\, examining their complexity and some of their most intriguing properties. T he main goal is to understand how we can transition from theory to experim ent and ensure that what we observe is genuinely quantum and truly random. \n LOCATION:https://researchseminars.org/talk/TalentQ/19/ END:VEVENT BEGIN:VEVENT SUMMARY:Emanuele Costa (University of Barcelona) DTSTART:20250311T150000Z DTEND:20250311T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/20 DESCRIPTION:Title: A Quantum Annealing Protocol to Solve the Nuclear Shell Model\nby Ema nuele Costa (University of Barcelona) as part of Quantum Spain\n\n\nAbstra ct\nThe nuclear shell model accurately describes the structure and dynamic s of atomic nuclei. However\, the exponential scaling of the basis size wi th the number of degrees of freedom hampers a direct numerical solution fo r heavy nuclei. In this talk\, I present a quantum annealing protocol to o btain nuclear ground states. I propose a tailored driver Hamiltonian that preserves a large gap and validate our approach in a dozen nuclei with bas is sizes up to 10^5 using classical simulations of the annealing evolution . I show the relation between the spectral gap and the total time of the a nnealing protocol\, assessing its accuracy by comparing the fidelity and e nergy relative error to classical benchmarks. While the nuclear Hamiltonia n is non-local and thus challenging to implement in current setups\, the e stimated computational cost of our annealing protocol on quantum circuits is polynomial in the many-body basis size\, paving the way to study heavie r nuclei.\n LOCATION:https://researchseminars.org/talk/TalentQ/20/ END:VEVENT BEGIN:VEVENT SUMMARY:Richard R. Allen (MIT) DTSTART:20250325T150000Z DTEND:20250325T160000Z DTSTAMP:20260422T225718Z UID:TalentQ/21 DESCRIPTION:Title: Quantum Computing Enhanced Sensing\nby Richard R. Allen (MIT) as part of Quantum Spain\n\n\nAbstract\nQuantum computing and quantum sensing rep resent two distinct frontiers of quantum information science. In this work \, we harness quantum computing to solve a fundamental and practically imp ortant sensing problem: the detection of weak oscillating fields with unkn own strength and frequency. We present a quantum computing enhanced sensin g protocol that outperforms all existing approaches. Furthermore\, we prov e our approach is optimal by establishing the Grover-Heisenberg limit — a fundamental lower bound on the minimum sensing time. The key idea is to robustly digitize the continuous\, analog signal into a discrete operation \, which is then integrated into a quantum algorithm. Our metrological gai n originates from quantum computation\, distinguishing our protocol from c onventional sensing approaches. Indeed\, we prove that broad classes of pr otocols based on quantum Fisher information\, finite-lifetime quantum memo ry\, or classical signal processing are strictly less powerful. Our protoc ol is compatible with multiple experimental platforms. We propose and anal yze a proof-of-principle experiment using nitrogen-vacancy centers\, where meaningful improvements are achievable using current technology. This wor k establishes quantum computation as a powerful new resource for advancing sensing capabilities.\n LOCATION:https://researchseminars.org/talk/TalentQ/21/ END:VEVENT BEGIN:VEVENT SUMMARY:Martin Ringbauer DTSTART:20250422T140000Z DTEND:20250422T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/22 DESCRIPTION:Title: Towards Quantum Simulation with Trapped-Ion qudits\nby Martin Ringbau er as part of Quantum Spain\n\n\nAbstract\nToday's quantum computers almos t exclusively follow the binary paradigm of their classical predecessor. Y et\, the applications for such devices\, most notably the simulation of ph ysics and chemistry\, often do not fit this paradigm. Natural systems come in a variety of spin dimensions and rarely have just two possible states. Quantum processors that natively support multi-level\, qudit\, operation give us a new tool for addressing the challenge of simulating nature effic iently. I will discuss qudit quantum computing with trapped ions at the ex ample of first quantum simulations with relevance to high-energy physics.\ n LOCATION:https://researchseminars.org/talk/TalentQ/22/ END:VEVENT BEGIN:VEVENT SUMMARY:Benedikt Poggel DTSTART:20250506T140000Z DTEND:20250506T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/23 DESCRIPTION:Title: Quantum Computing with a purpose – how do we decide when a solution pat h is beneficial?\nby Benedikt Poggel as part of Quantum Spain\n\n\nAbs tract\nTo prove useful\, quantum computing needs to outperform classical a lgorithms on practically relevant applications. With the simultaneous adva nces in hardware\, theory\, software and applications driven by a highly d iverse and interdisciplinary research community\, it is easy to lose track of this ultimate goal. In this seminar\, we discuss how application-drive n research can help bridge the gap between the technology and its end user s. Topics include the interplay of the classical and quantum parts of a fu ll solution pipeline\, how to build towards abstraction layers\, and an in -depth discussion of https://arxiv.org/abs/2503.14696 highlighting a cen tral obstacle in the application of variational algorithms in the context of near-term quantum computing.\n LOCATION:https://researchseminars.org/talk/TalentQ/23/ END:VEVENT BEGIN:VEVENT SUMMARY:Mar Tejedor DTSTART:20250603T140000Z DTEND:20250603T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/24 DESCRIPTION:Title: Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Per formance Computing\nby Mar Tejedor as part of Quantum Spain\n\n\nAbstr act\nMost quantum computers today are constrained by hardware limitations\ ,\nparticularly the number of available qubits\, causing significant\nchal lenges for executing large-scale quantum algorithms. Circuit cutting\nhas emerged as a key technique to overcome these limitations by\ndecomposing l arge quantum circuits into smaller subcircuits that can be\nexecuted indep endently and later reconstructed. In this work\, we\nintroduce Qdislib\, a distributed and flexible library for quantum\ncircuit cutting\, designed to seamlessly integrate with hybrid\nquantum-classical high-performance co mputing (HPC) systems. Qdislib\nemploys a graph-based representation of qu antum circuits to enable\nefficient partitioning\, manipulation and execut ion\, supporting both wire\ncutting and gate cutting techniques. The libra ry is compatible with\nmultiple quantum computing libraries\, including Qi skit and Qibo\, and\nleverages distributed computing frameworks to execute subcircuits across\nCPUs\, GPUs\, and quantum processing units (QPUs) in a fully parallelized\nmanner. We present a proof of concept demonstrating how Qdislib enables\nthe distributed execution of quantum circuits across heterogeneous\ncomputing resources\, showcasing its potential for scalable \nquantum-classical workflows.\n LOCATION:https://researchseminars.org/talk/TalentQ/24/ END:VEVENT BEGIN:VEVENT SUMMARY:Carmen G. Almudever DTSTART:20240617T140000Z DTEND:20240617T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/25 DESCRIPTION:Title: Toward Scalable Quantum Computers: Transitioning from Monolithic to Modul ar Multicore Architectures\nby Carmen G. Almudever as part of Quantum Spain\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/TalentQ/25/ END:VEVENT BEGIN:VEVENT SUMMARY:Carmen G. Almudever DTSTART:20250617T140000Z DTEND:20250617T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/26 DESCRIPTION:Title: Toward Scalable Quantum Computers: Transitioning from Monolithic to Modul ar Multicore Architectures\nby Carmen G. Almudever as part of Quantum Spain\n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/TalentQ/26/ END:VEVENT BEGIN:VEVENT SUMMARY:Carlos Ramos Marimón DTSTART:20250923T140000Z DTEND:20250923T150000Z DTSTAMP:20260422T225718Z UID:TalentQ/27 DESCRIPTION:Title: Off-diagonal Pauli Weight truncation and equilibration temperature depend ence for simulating local dynamics in quantum systems\nby Carlos Ramos Marimón as part of Quantum Spain\n\n\nAbstract\nThe complexity of simula ting the out-of-equilibrium evolution of local operators in the Heisenberg picture is governed by the operator entanglement\, which grows linearly i n time for generic nonintegrable systems\, leading to an exponential incre ase in computational resources. A promising approach to simplify this chal lenge involves discarding parts of the operator and focusing on a subspace formed by “light” Pauli strings—strings with few Pauli matrices—a s proposed by Rakovszki et al. [Phys. Rev. B 105\, 07513 (2022)] for infin ite temperature settings.\nIn our recent works [Phys. Rev. B 111\, 094301( 2025)\, In preparation]\, we investigated whether this strategy can be app lied to quenches starting from homogeneous product states\, end extend it to handle arbitrary temperatures\, since the evolution of ergodic Hamilton ians combined with these initial states grant access to a wide range of eq uilibration regimes.\nBy concentrating on the required matrix elements and retaining only the portion of the operator that contains Pauli strings pa rallel to the initial state\, we uncover a complex scenario. For intermedi ate simulation times\, in some cases the light Pauli strings suffice to de scribe the dynamics\, enabling efficient simulation with current algorithm s\; however\, for other cases heavier strings become necessary\, pushing c omputational demands beyond our current capabilities.\nFor long simulation times\, we detect that complexity is intimately correlated with the equil ibration temperature\, and that our modified method agrees with the state- of-the art transverse contraction simulations. In the process\, we found t hat the transverse light-cone algorithm also displays a complexity correla ted with temperature\, which can be explained by a careful reinterpretatio n of our results in [Phys. Rev. Research 6\, 033021(2024)].\n LOCATION:https://researchseminars.org/talk/TalentQ/27/ END:VEVENT END:VCALENDAR