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:20260404T111009Z
UID:TalentQ/1
DESCRIPTION:Title: Conformal Quantum Cellular Automata\nby Lluis Masanes (London C
entre for 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 dim
ensions consisting of dual-unitary circuits. The symmetry of these QCAs is
a discrete version of the conformal group\, hence\, these models inherita
te many features of conformal field theory. With the same dual unitaries I
will construct tensor-network states and interpret them as spatial slices
of curved 2+1 discrete geometries. The QCA induces a dynamics on these (b
ulk) geometries which reproduces gravitational phenomena like gravitationa
l time dilation\, the formation of black holes and the growth of their thr
oat.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Laura Schulz (Leibniz Supercomputing Centre)
DTSTART:20240409T140000Z
DTEND:20240409T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/2
DESCRIPTION:Title: Quantum-Accelerated Supercomputing: Where we are and where we need
to go.\nby Laura Schulz (Leibniz Supercomputing Centre) as part of Qua
ntum Spain\n\n\nAbstract\nQuantum computing is a breakthrough science and
technology star\, but its true power lies in partnering with supercomputin
g. In this presentation\, I’ll highlight LRZ’s multi-dimensional effor
ts to provide\, merge and optimize various quantum accelerators into HPC w
orkflows and into HPC centers. This includes insights into the development
of the Munich Quantum Software Stack and its mission to compute with hybr
id HPC-QC using multiple quantum systems. I’ll discuss where we are at t
his point 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://stable.researchseminars.org/talk/TalentQ/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zoë Holmes (EPFL)
DTSTART:20240507T140000Z
DTEND:20240507T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/3
DESCRIPTION:Title: Does provable absence of barren plateaus imply classical simulabili
ty?\nby Zoë Holmes (EPFL) as part of Quantum Spain\n\n\nAbstract\nA l
arge amount of effort has recently been put into understanding the barren
plateau phenomenon. In this perspective article\, we face the increasingly
loud elephant in the room and ask a question that has been hinted at by m
any but not explicitly addressed: Can the structure that allows one to avo
id barren plateaus also be leveraged to efficiently simulate the loss clas
sically? We present strong evidence that commonly used models with provabl
e absence of barren plateaus are also classically simulable\, provided tha
t one can collect some classical data from quantum devices during an initi
al data acquisition phase. This follows from the observation that barren p
lateaus result from a curse of dimensionality\, and that current approache
s for solving them end up encoding the problem into some small\, classical
ly simulable\, subspaces. This sheds serious doubt on the non-classicality
of the information processing capabilities of parametrized quantum circui
ts for barren plateau-free landscapes and on the possibility of superpolyn
omial advantages from running them on quantum hardware. We end by discussi
ng caveats in our arguments\, the potential of smart initializations\, and
by highlighting new opportunities that our perspective raises.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Vasmer (Xanadu)
DTSTART:20240521T140000Z
DTEND:20240521T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/4
DESCRIPTION:Title: Quantum error correction with constant time overhead\nby Michae
l Vasmer (Xanadu) as part of Quantum Spain\n\n\nAbstract\nThe promise of q
uantum computers is currently limited by noise. Quantum error correction h
as the potential to overcome this problem\, at the cost of large space and
time overheads. The usual approach to diagnose errors in a quantum error-
correcting code is to measure certain parity-check operators. These outcom
es are then processed by a classical algorithm (a decoder) to find a recov
ery operator that corrects the errors. In most cases it is necessary to do
many rounds of parity-check measurements as part of the error correction
procedure\, resulting in a large time overhead. In this talk I will give a
n introduction to quantum error correction and the decoding problem and th
en discuss 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://stable.researchseminars.org/talk/TalentQ/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Javier Robledo (IBM)
DTSTART:20240604T140000Z
DTEND:20240604T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/5
DESCRIPTION:Title: Chemistry Beyond Exact Solutions on a Quantum-Centric Supercomputer
\nby Javier Robledo (IBM) as part of Quantum Spain\n\n\nAbstract\nA un
iversal quantum computer can be used as a simulator capable of predicting
properties of diverse quantum systems. Electronic structure problems in ch
emistry offer practical use cases around the hundred-qubit mark. This appe
ars promising since current quantum processors have reached these sizes. H
owever\, mapping these use cases onto quantum computers yields deep circui
ts\, and for for pre-fault-tolerant quantum processors\, the large number
of measurements to estimate molecular energies leads to prohibitive runtim
es. As a result\, realistic chemistry is out of reach of current quantum c
omputers in isolation. A natural question is whether classical distributed
computation can relieve quantum processors from parsing all but a core\,
intrinsically quantum component of a chemistry workflow. In this seminar\,
I will discuss the incorporation of quantum computations of chemistry in
a quantum-centric supercomputing architecture\, using up to 6400 nodes of
the supercomputer Fugaku to assist a Heron superconducting quantum process
or. We simulate the N2 triple bond breaking in a correlation-consistent cc
-pVDZ basis set\, and the active-space electronic structure of [2Fe–2S]
and [4Fe–4S] clusters\, using 58\, 45 and 77 qubits respectively\, with
quantum circuits of up to 10570 (3590 2-qubit) quantum gates.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Antonio Rubio (ICFO)
DTSTART:20240611T140000Z
DTEND:20240611T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/6
DESCRIPTION:Title: QUIONE: A quantum simulator based on ultracold strontium atoms\
nby Antonio Rubio (ICFO) as part of Quantum Spain\n\n\nAbstract\nNeutral a
toms have a wide range of applications in quantum science and technology.
Strontium atoms\, in particular\, are popular for their use as atomic cloc
ks in the field of quantum metrology. But recently\, their preparation in
optical lattices and tweezers has also been exploited for quantum simulati
on and quantum computing. In this talk I will present QUIONE: an analog qu
antum simulator able to detect individual strontium atoms. The experiment\
, built at ICFO\, constitutes the first strontium quantum-gas microscope.
This means that we can prepare quantum-degenerate gases in an optical latt
ice and detect them with single-site resolution. By using a bosonic isotop
e\, we can realize the Bose-Hubbard model and use our microscope to prepar
e and detect superfluid phases of matter. Finally\, I will also show that\
, by switching to a different isotope of strontium\, we can prepare fermio
nic gases\, and will soon allow us to study the exotic phases of the SU(N)
Hubbard model.\n\nhttps://www.talentq.es/es_es/evento/talentq-seminar-ant
onio-rubio-postdoctoral-researcher-at-icfo/\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Henry Semenenko (Quantinuum)
DTSTART:20240625T140000Z
DTEND:20240625T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/7
DESCRIPTION:Title: Quantum Error Correction and Scaling with Trapped-Ions\nby Henr
y Semenenko (Quantinuum) as part of Quantum Spain\n\nAbstract: TBA\n\nQuan
tinuum's quantum processors use the quantum charge-coupled device (QCCD) a
rchitecture with trapped-ion qubits to deliver leading performance with hi
gh-fidelity gates and all-to-all connectivity. As we look towards performi
ng more complex algorithms that require vast numbers of operations\, it wi
ll be necessary to develop quantum error correction (QEC) to reduce error
below the physical level. Recent QEC results using Quantinuum's processors
have demonstrated logical error rates significantly below the physical le
vel signifying a transition towards reliable quantum computing. This talk
will provide an overview of the QCCD trapped-ion architecture\, present QE
C results demonstrating better-than-physical error rates\, and discuss the
future scaling of Quantinuum's processors.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Esperanza Cuenca (NVIDIA)
DTSTART:20240709T140000Z
DTEND:20240709T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/8
DESCRIPTION:Title: Programming Heterogenous Quantum-Classical Supercomputing Architect
ures\nby Esperanza Cuenca (NVIDIA) as part of Quantum Spain\n\n\nAbstr
act\nValuable quantum computing will integrate tightly with and depend on
classical high-performance computing and AI. Such a hybrid system needs a
programming model that enables easy and performant co-programming across q
uantum and classical resources. NVIDIA CUDA-Q is an open-source platform f
or integrating and programming QPUs\, GPUs\, and CPUs in a single system.
Additionally\, the ability of scientists\, developers\, and researchers to
simulate quantum circuits on classical computers is vital for quantum com
puting. NVIDIA cuQuantum is an SDK for accelerating quantum circuit simula
tion. Built to accelerate all circuit simulation frameworks and integrated
into CUDA-Q and more\, cuQuantum allows simulations of ideal or noisy qub
its with scale and performance. During this talk CUDA-Q main features will
be presented\, as well as some representative works.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alejandro Gómez (IQM Quantum Computers)
DTSTART:20240910T140000Z
DTEND:20240910T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/9
DESCRIPTION:Title: Towards quantum advantage on the cloud: benchmarking a 20 qubit qua
ntum computer\nby Alejandro Gómez (IQM Quantum Computers) as part of
Quantum Spain\n\n\nAbstract\nQuantum computing is a field with incredible
potential to solve fundamental limitations of classical computing\, as wel
l as provide a way for scientists to simulate complex quantum systems. Cur
rent technological implementations require further improvements in quality
and scalability in order for the field to reach its full potential. IQM Q
uantum Computers has developed universal gate-based QPUs\, based on superc
onducting technology\, as an approach to scale up towards practical quantu
m advantage. This seminar will provide an overview of the architectures an
d technologies being developed at IQM Quantum Computers\, with a focus on
the recently published benchmarks of IQM Garnet\, our cloud-accessible 20
qubit quantum computer.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pablo Bermejo
DTSTART:20240924T140000Z
DTEND:20240924T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/10
DESCRIPTION:Title: Quantum Convolutional Neural Networks are (Effectively) Classicall
y Simulable\nby Pablo Bermejo as part of Quantum Spain\n\n\nAbstract\n
Quantum Convolutional Neural Networks (QCNNs) are widely regarded as a pro
mising model for Quantum Machine Learning (QML). In this work we tie their
heuristic success to two facts. First\, that when randomly initialized\,
they can only operate on the information encoded in low-bodyness measureme
nts of their input states. And second\, that they are commonly benchmarked
on "locally-easy'' datasets whose states are precisely classifiable by th
e information encoded in these low-bodyness observables subspace. We furth
er show that the QCNN's action on this subspace can be efficiently classic
ally simulated by a classical algorithm equipped with Pauli shadows on the
dataset. Indeed\, we present a shadow-based simulation of QCNNs on up-to
1024 qubits for phases of matter classification. Our results can then be u
nderstood as highlighting a deeper symptom of QML: Models could only be sh
owing heuristic success because they are benchmarked on simple problems\,
for which their action can be classically simulated. This insight points t
o the fact that non-trivial datasets are a truly necessary ingredient for
moving forward with QML. To finish\, we discuss how our results can be ext
rapolated to classically simulate other architectures.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Richard Kueng
DTSTART:20241008T140000Z
DTEND:20241008T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/11
DESCRIPTION:Title: Classical shadows in theory\, numerics and experiment\nby Rich
ard Kueng as part of Quantum Spain\n\n\nAbstract\nClassical shadows are a
scalable way to extract meaningful information from a n-qubit system in a
scalable and online fashion. Crucially\, this method has the potential to
overcome bottlenecks that plague more traditional general-purpose readout
protocols. We will review the overall idea and then present numerical simu
lations (in silico) and experimental implementations (in vitro) of classic
al shadows on existing quantum hardware.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Roberta Zambrini
DTSTART:20241022T140000Z
DTEND:20241022T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/12
DESCRIPTION:Title: Reservoir computing with complex quantum systems\nby Roberta Z
ambrini as part of Quantum Spain\n\n\nAbstract\nNon-conventional computing
inspired by the brain\, or neuromorphic computing\, is a successful appro
ach in a broad spectrum of applications\, and in the last few years propos
als of Quantum Reservoir Computing have been explored. Quantum physical re
servoirs have the potential to boost the processing performance in tempora
l tasks by exploiting quantum coherence\, not requiring error correction a
nd not suffering optimization limitations. Furthermore this approach is na
turally suited for fully quantum information processing (with quantum inpu
ts). In this talk we will briefly review the state of the art and focus on
recent results exploring the potential of different platforms and operati
on regimes\, the role of quantum coherence and entanglement\, and how to o
vercome the challenges of real-time quantum reservoir computing.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maria Schuld (Xanadu)
DTSTART:20241105T150000Z
DTEND:20241105T160000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/13
DESCRIPTION:Title: But why would we use quantum computers after all? Approaching Quan
tum Machine Learning a little differently\nby Maria Schuld (Xanadu) as
part of Quantum Spain\n\n\nAbstract\nThe last years of research in quantu
m machine learning have taught us a lot. There are problems where quantum
computers have a provable advantage for learning (just apply Shor somewher
e!). Training variational "quantum neural networks" is a matter of a few l
ines 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 fo
r "quantum data". And a lot has been written about barren plateaus. But wh
y\, on earth\, should we use quantum computers for machine learning at all
? It seems that we have not come any closer to answering this question. In
this informal talk based on arXiv2409.00172\, I suggest a slightly differ
ent approach to QML: One where we stare hard at a famous family of quantum
algorithms\, try to understand why they work (not when they are faster) a
nd muse how this could be turned into a learning principle. Expect no spee
dup and no end-to-end learning algorithm\, but a lot of educated speculati
on.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marco Cerezo (LANL)
DTSTART:20241119T150000Z
DTEND:20241119T160000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/14
DESCRIPTION:Title: Is Quantum Machine Learning an ill-defined framework?\nby Marc
o Cerezo (LANL) as part of Quantum Spain\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Diego Andrade (UDC)
DTSTART:20241203T150000Z
DTEND:20241203T160000Z
DTSTAMP:20260404T111009Z
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\nB
enchmarking Quantum Computers is required to objectively evaluate these pl
atforms' performance\, stressing their capabilities and leading the evolut
ion of the hardware platforms. Some approaches work at the hardware level
and are not necessarily linked to any practical application\, others are b
ased on representative real-world use cases of this technology. This semin
ar will introduce the attendees to the topic of benchmarking Quantum Compu
ters. Then\, we will focus on our approach “The NEASQC Benchmark Suite (
TNBS)”\, an application-driven approach designed to measure the speed an
d accuracy of quantum platforms when executing representative workloads. W
e will also introduce the audience to its code repository and main support
documents.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vedran Dunjko (Leiden University)
DTSTART:20241217T150000Z
DTEND:20241217T160000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/16
DESCRIPTION:Title: Topics in quantum topological data analysis\nby Vedran Dunjk
o (Leiden University) as part of Quantum Spain\n\n\nAbstract\nAlthough sti
ll arguably an emerging field in classical machine learning\, topological
data analysis has already raised substantial interest from the perspective
of quantum algorithms in the last few years\, and for good reasons. In th
is talk we will explain why this is the case. \nWe will introduce the topi
c of topological data analysis and discuss the state-of-art of quantum alg
orithms for computational problems in TDA - this will include the problems
of estimating the so-called Betti numbers and the problems of deciding pu
rsuance of topological features in data. We will address their promises an
d limitations\, possible generalizations and connections to many-body phys
ics.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Andrew Lucas (University of Colorado Boulder)
DTSTART:20250128T160000Z
DTEND:20250128T170000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/17
DESCRIPTION:Title: Low-density parity-check codes as stable phases of quantum matter<
/a>\nby Andrew Lucas (University of Colorado Boulder) as part of Quantum S
pain\n\n\nAbstract\nPhases of matter with robust ground-state degeneracy\,
such as the quantum toric code\, are known to be capable of robust quantu
m information storage. Here\, we address the converse question: given a qu
antum error correcting code\, when does it define a stable gapped quantum
phase of matter\, whose ground state degeneracy is robust against perturba
tions in the thermodynamic limit? An affirmative answer to this question c
ould allow us to leverage techniques from quantum error correction to lear
n new things about quantum statistical mechanics. We have proved that a lo
w-density parity-check (LDPC) code defines such a phase\, robust against a
ll few-body perturbations\, if its code distance grows at least logarithmi
cally in the number of degrees of freedom\, and it exhibits a property tha
t we call "check soundness". Many constant-rate quantum LDPC expander code
s have such properties\, and define stable phases of matter with a constan
t zero-temperature entropy density\, violating the third law of thermodyna
mics. Our results also show that quantum toric code phases are robust to s
patially nonlocal few-body perturbations. I will conclude with potential
applications for our ideas in condensed matter physics.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Almudena Carrera (IBM)
DTSTART:20250211T150000Z
DTEND:20250211T160000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/18
DESCRIPTION:Title: Combining quantum processors with real-time classical communicatio
n\nby Almudena Carrera (IBM) as part of Quantum Spain\n\n\nAbstract\nM
any applications of quantum computing require more connectivity than the p
lanar lattice offered by the hardware on more qubits than is available on
a single quantum processing unit (QPU). In this work\, we address both cha
llenges by linking two QPUs in real time via a classical channel\, effecti
vely unifying them into a single\, larger-scale quantum computer. We demon
strate error-mitigated dynamic circuits and circuit cutting across two 127
-qubit processors\, creating quantum states spanning up to 142 qubits and
achieving a periodic connectivity that exceeds what one QPU alone can offe
r.\nIn this talk\, I will discuss the experimental methods behind these re
sults\, emphasizing both the conceptual and practical aspects of circuit c
utting. I will also compare two different approaches—one without classic
al communication and one with real-time classical communication—and expl
ore how each affects the feasibility of this technique.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Davide Rusca (VQCC - University of Vigo)
DTSTART:20250225T150000Z
DTEND:20250225T160000Z
DTSTAMP:20260404T111009Z
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\nRandom
ness seems like a straightforward concept\, both intuitively and mathemati
cally. However\, this confidence wavers when we consider the physical natu
re of reality. A simple classical description of the world suggests that e
verything\, no matter how chaotic\, is ultimately deterministic. Few would
guess that the only way to truly reintroduce randomness into nature is th
rough quantum mechanics\, where the probabilistic nature of measurement ou
tcomes is intrinsic to the theory. But how can we observe this in a lab? H
ow can we harness these properties of nature to generate true randomness?
In this talk\, we will explore the history of Quantum Random Number Genera
tors\, examining their complexity and some of their most intriguing proper
ties. The main goal is to understand how we can transition from theory to
experiment and ensure that what we observe is genuinely quantum and truly
random.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Emanuele Costa (University of Barcelona)
DTSTART:20250311T150000Z
DTEND:20250311T160000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/20
DESCRIPTION:Title: A Quantum Annealing Protocol to Solve the Nuclear Shell Model\
nby Emanuele Costa (University of Barcelona) as part of Quantum Spain\n\n\
nAbstract\nThe nuclear shell model accurately describes the structure and
dynamics of atomic nuclei. However\, the exponential scaling of the basis
size with the number of degrees of freedom hampers a direct numerical solu
tion for heavy nuclei. In this talk\, I present a quantum annealing protoc
ol to obtain nuclear ground states. I propose a tailored driver Hamiltonia
n that preserves a large gap and validate our approach in a dozen nuclei w
ith basis sizes up to 10^5 using classical simulations of the annealing ev
olution. I show the relation between the spectral gap and the total time o
f the annealing protocol\, assessing its accuracy by comparing the fidelit
y and energy relative error to classical benchmarks. While the nuclear Ham
iltonian is non-local and thus challenging to implement in current setups\
, the estimated computational cost of our annealing protocol on quantum ci
rcuits is polynomial in the many-body basis size\, paving the way to study
heavier nuclei.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Richard R. Allen (MIT)
DTSTART:20250325T150000Z
DTEND:20250325T160000Z
DTSTAMP:20260404T111009Z
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 sens
ing represent two distinct frontiers of quantum information science. In th
is work\, we harness quantum computing to solve a fundamental and practica
lly important sensing problem: the detection of weak oscillating fields wi
th unknown strength and frequency. We present a quantum computing enhanced
sensing protocol that outperforms all existing approaches. Furthermore\,
we prove our approach is optimal by establishing the Grover-Heisenberg lim
it — a fundamental lower bound on the minimum sensing time. The key idea
is to robustly digitize the continuous\, analog signal into a discrete op
eration\, which is then integrated into a quantum algorithm. Our metrologi
cal gain originates from quantum computation\, distinguishing our protocol
from conventional sensing approaches. Indeed\, we prove that broad classe
s of protocols based on quantum Fisher information\, finite-lifetime quant
um memory\, or classical signal processing are strictly less powerful. Our
protocol is compatible with multiple experimental platforms. We propose a
nd analyze a proof-of-principle experiment using nitrogen-vacancy centers\
, where meaningful improvements are achievable using current technology. T
his work establishes quantum computation as a powerful new resource for ad
vancing sensing capabilities.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Martin Ringbauer
DTSTART:20250422T140000Z
DTEND:20250422T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/22
DESCRIPTION:Title: Towards Quantum Simulation with Trapped-Ion qudits\nby Martin
Ringbauer as part of Quantum Spain\n\n\nAbstract\nToday's quantum computer
s almost exclusively follow the binary paradigm of their classical predece
ssor. Yet\, the applications for such devices\, most notably the simulatio
n of physics and chemistry\, often do not fit this paradigm. Natural syste
ms come in a variety of spin dimensions and rarely have just two possible
states. Quantum processors that natively support multi-level\, qudit\, ope
ration give us a new tool for addressing the challenge of simulating natur
e efficiently. I will discuss qudit quantum computing with trapped ions at
the example of first quantum simulations with relevance to high-energy ph
ysics.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benedikt Poggel
DTSTART:20250506T140000Z
DTEND:20250506T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/23
DESCRIPTION:Title: Quantum Computing with a purpose – how do we decide when a solut
ion path is beneficial?\nby Benedikt Poggel as part of Quantum Spain\n
\n\nAbstract\nTo prove useful\, quantum computing needs to outperform clas
sical algorithms on practically relevant applications. With the simultaneo
us advances in hardware\, theory\, software and applications driven by a h
ighly diverse and interdisciplinary research community\, it is easy to los
e track of this ultimate goal. In this seminar\, we discuss how applicatio
n-driven research can help bridge the gap between the technology and its e
nd users. Topics include the interplay of the classical and quantum parts
of a full solution pipeline\, how to build towards abstraction layers\, an
d an in-depth discussion of https://arxiv.org/abs/2503.14696 highlightin
g a central obstacle in the application of variational algorithms in the c
ontext of near-term quantum computing.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mar Tejedor
DTSTART:20250603T140000Z
DTEND:20250603T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/24
DESCRIPTION:Title: Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical H
igh-Performance Computing\nby Mar Tejedor as part of Quantum Spain\n\n
\nAbstract\nMost quantum computers today are constrained by hardware limit
ations\,\nparticularly the number of available qubits\, causing significan
t\nchallenges for executing large-scale quantum algorithms. Circuit cuttin
g\nhas emerged as a key technique to overcome these limitations by\ndecomp
osing large quantum circuits into smaller subcircuits that can be\nexecute
d independently and later reconstructed. In this work\, we\nintroduce Qdis
lib\, a distributed and flexible library for quantum\ncircuit cutting\, de
signed to seamlessly integrate with hybrid\nquantum-classical high-perform
ance computing (HPC) systems. Qdislib\nemploys a graph-based representatio
n of quantum circuits to enable\nefficient partitioning\, manipulation and
execution\, supporting both wire\ncutting and gate cutting techniques. Th
e library is compatible with\nmultiple quantum computing libraries\, inclu
ding Qiskit and Qibo\, and\nleverages distributed computing frameworks to
execute subcircuits across\nCPUs\, GPUs\, and quantum processing units (QP
Us) in a fully parallelized\nmanner. We present a proof of concept demonst
rating how Qdislib enables\nthe distributed execution of quantum circuits
across heterogeneous\ncomputing resources\, showcasing its potential for s
calable\nquantum-classical workflows.\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carmen G. Almudever
DTSTART:20240617T140000Z
DTEND:20240617T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/25
DESCRIPTION:Title: Toward Scalable Quantum Computers: Transitioning from Monolithic t
o Modular Multicore Architectures\nby Carmen G. Almudever as part of Q
uantum Spain\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carmen G. Almudever
DTSTART:20250617T140000Z
DTEND:20250617T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/26
DESCRIPTION:Title: Toward Scalable Quantum Computers: Transitioning from Monolithic t
o Modular Multicore Architectures\nby Carmen G. Almudever as part of Q
uantum Spain\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Carlos Ramos Marimón
DTSTART:20250923T140000Z
DTEND:20250923T150000Z
DTSTAMP:20260404T111009Z
UID:TalentQ/27
DESCRIPTION:Title: Off-diagonal Pauli Weight truncation and equilibration temperature
dependence for simulating local dynamics in quantum systems\nby Carlo
s Ramos Marimón as part of Quantum Spain\n\n\nAbstract\nThe complexity of
simulating the out-of-equilibrium evolution of local operators in the Hei
senberg picture is governed by the operator entanglement\, which grows lin
early in time for generic nonintegrable systems\, leading to an exponentia
l increase in computational resources. A promising approach to simplify th
is challenge involves discarding parts of the operator and focusing on a s
ubspace formed by “light” Pauli strings—strings with few Pauli matri
ces—as proposed by Rakovszki et al. [Phys. Rev. B 105\, 07513 (2022)] fo
r infinite temperature settings.\nIn our recent works [Phys. Rev. B 111\,
094301(2025)\, In preparation]\, we investigated whether this strategy can
be applied to quenches starting from homogeneous product states\, end ext
end it to handle arbitrary temperatures\, since the evolution of ergodic H
amiltonians combined with these initial states grant access to a wide rang
e of equilibration regimes.\nBy concentrating on the required matrix eleme
nts and retaining only the portion of the operator that contains Pauli str
ings parallel to the initial state\, we uncover a complex scenario. For in
termediate simulation times\, in some cases the light Pauli strings suffic
e to describe the dynamics\, enabling efficient simulation with current al
gorithms\; however\, for other cases heavier strings become necessary\, pu
shing computational demands beyond our current capabilities.\nFor long sim
ulation times\, we detect that complexity is intimately correlated with th
e equilibration temperature\, and that our modified method agrees with the
state-of-the art transverse contraction simulations. In the process\, we
found that the transverse light-cone algorithm also displays a complexity
correlated with temperature\, which can be explained by a careful reinterp
retation of our results in [Phys. Rev. Research 6\, 033021(2024)].\n
LOCATION:https://stable.researchseminars.org/talk/TalentQ/27/
END:VEVENT
END:VCALENDAR