Samuele Piccinelli, Stefano Barison, Alberto Baiardi, Francesco Tacchino, Jascha Repp, Igor Rončević, Florian Albrecht, Harry L. Anderson, Leo Gross, Alessandro Curioni, Ivano Tavernelli • Published: 2026-03-09
We report quantum chemistry calculations performed on superconducting quantum processors for a molecule exhibiting the half-Möbius electronic topology originally introduced by Rončević et al. Using SqDRIFT, a randomized sample-based Krylov quantum diagonalization algorithm, we achieve reliable quantum simulations on active spaces corresponding to 36 orbitals (72 qubits) and extend previous studies...
Alessandro Cosentino, Changhao Li, Vincent Russo, Bradley A. Chase, Tom Lubinski, Siyuan Niu, Neer Patel, Nathan Shammah, William J. Zeng • Published: 2026-03-09
The fragmented landscape of quantum computer benchmarks, characterized by system-specific tools and inconsistent evaluation methodologies, hinders reliable cross-platform performance assessment. We introduce Metriq, an open-source collaborative platform for reproducible cross-platform quantum benchmarking that integrates benchmark definition and execution, data collection, and public presentation ...
Mikel Garcia-de-Andoin, Alatz Álvarez-Ahedo, Adrián Franco-Rubio, Mikel Sanz • Published: 2025-05-06
Digital-analog is a universal quantum computing paradigm which employs the natural entangling Hamiltonian of the system and single-qubit gates as resources. Here, we study the stability of these protocols against Hamiltonian characterization errors. For this, we bound the maximum separation between the target and the implemented Hamiltonians. Additionally, we obtain an upper bound for the deviatio...
Baptiste Claudon, Sergi Ramos-Calderer, Jean-Philip Piquemal • Published: 2026-03-09
Quantum algorithms present a quadratically improved complexity over classical ones for certain sampling tasks. For instance, the Quantum Amplitude Estimation (QAE) algorithm promises to speedup the estimation of the mean of certain functions, given access to the quantum state corresponding to the probability distribution to be sampled from. Classically, samples are often obtained by running steps ...
Kyoungho Cho, Ilkwon Sohn, Yongsoo Hwang, Jeongho Bang • Published: 2026-03-08
Gate fidelity -- an average fidelity over all possible input states -- is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically quantifiable by so-called the diamond distance. In the low-error regime, the coherent errors can inflate the worst-case error even when the reported gate fidelity is h...
Viraaji Mothukuri, Reza M. Parizi • Published: 2026-03-07
This review examines how quantum computing and artificial intelligence challenge current cryptographic systems. We analyze the literature to assess the resilience of algorithms against quantum attacks (Shor's and Grover's algorithms) and AI-enhanced cryptanalysis. RSA and elliptic curve cryptography are at risk of compromise from quantum computers. Symmetric algorithms like AES-128 retain security...
Giorgio Grigolo, Dorian Schiffer, Lukas Gerster, Martin Ringbauer, Paul Erker • Published: 2026-03-06
Analogously to classical computers, quantum processors exhibit side channels that may give attackers access to potentially proprietary algorithms. We identify and exploit a previously unexplored side channel in trapped-ion quantum processors that arises from the radio-frequency (RF) signals used to modulate lasers for ion cooling, gate execution, and readout. In these quantum processors, acousto-o...
Zeynab Kaseb, Matthias Moller, Peter Palensky, Pedro P. Vergara • Published: 2025-10-15
We present the first direct comparison between gate-based quantum computing (GQC) and adiabatic quantum computing (AQC) paradigms for solving the AC power flow (PF) equations. The PF problem is reformulated as a combinatorial optimization problem. For the GQC approach, the Quantum Approximate Optimization Algorithm (QAOA) is employed, while for the AQC approach, the problem is formulated as an Isi...
George Pennington, Kevin C. Smith, James R. Garrison, Lachlan P. Lindoy, Jason Crain, Ben Jaderberg • Published: 2026-03-06
Symmetry-protected topological (SPT) phases extend the Landau paradigm of quantum matter by admitting distinct symmetry-preserving phases that lack any local order parameter. Demonstrating these phases at scale on programmable quantum processors is a key milestone in using quantum hardware to probe emergent many-body phenomena, yet it is impeded by the circuit depth normally required to capture no...
Marco Zaopo • Published: 2025-12-10
We present a new model of quantum computation rooted in the representation theory of the mass less sector of unitary irreducible representations of the extended Poincare group developed in [1].