8 citations · 10 across the 14 of their papers we have counts for
14 papers
Hardware-Aware Fermion-to-Qubit Mappings for Simulating the 2D Hubbard Model on Heavy-Hexagon Quantum Processors
Alessio Esposito, Andrea Giachero, Zoltàn Zimboràs +1
Quantum simulation of strongly correlated fermionic systems is among the most promising near- term applications of quantum computing, but its practical efficiency depends criticall…
Observable Estimation in the Absence of Classical Verification
Samantha V. Barron, Bradley Mitchell, Vinay Tripathi +45
The predictive success of quantum mechanics underpins many areas of modern science, even as the exact simulation of large, interacting quantum systems remains beyond the reach of c…
Repetition-code-based readout error detection and correction across hardware platforms and generations
Csaba Czabán, Orsolya Kálmán, Sergey N. Filippov +1
Readout errors are one of the dominant sources of noise in current quantum processors, limiting both expectation-value estimation and sampling-based applications. Since they affect…
Classical simulation of free-fermionic dynamics and quantum chemistry with magic input
Changhun Oh, Michał Oszmaniec, Oliver Reardon-Smith +1
Establishing the precise computational boundary between classically tractable fermionic systems and those capable of genuine quantum advantage is a central challenge in quantum sim…
General framework for anticoncentration and linear cross-entropy benchmarking in photonic quantum advantage experiments
Zoltán Kolarovszki, Ágoston Kaposi, Zoltán Zimborás +1
Photonic architectures are one of the leading platforms for demonstrating quantum computational advantage, with Boson Sampling and Gaussian Boson Sampling as the primary schemes. Y…
Generative modeling with Gaussian Boson Sampling: classically trainable Bosonic Born Machines
Zoltán Kolarovszki, Bence Bakó, Michał Oszmaniec +2
Quantum generative modeling has emerged as a promising application of quantum computers, aiming to model complex probability distributions beyond the reach of classical methods. In…
Universality of Classically Trainable, Quantum-Deployed Boson-Sampling Generative Models
Andrii Kurkin, Ulysse Chabaud, Zoltán Kolarovszki +3
Recent work on the instantaneous quantum polynomial-time (IQP) quantum-circuit Born machine (QCBM) highlights a promising paradigm for generative modeling: train classically, deplo…
The EU Quantum Flagship's Key Performance Indicators for Quantum Computing
Zoltán Zimborás, Attila Portik, David Aguirre +10
As quantum processors continue to scale in size and complexity, the need for well-defined, reproducible, and technology-agnostic performance metrics becomes increasingly critical.…
Clifford Volume and Free Fermion Volume: Complementary Scalable Benchmarks for Quantum Computers
Attila Portik, Orsolya Kálmán, Thomas Monz +1
As quantum computing advances toward the late-NISQ and early fault-tolerant eras, scalable and platform-independent benchmarks are essential for quantifying computational capacity…
Fermionic Born Machines: Classical training of quantum generative models based on Fermion Sampling
Bence Bakó, Zoltán Kolarovszki, Zoltán Zimborás
Quantum generative learning is a promising application of quantum computers, but faces several trainability challenges, including the difficulty in experimental gradient estimation…
Decomposition of multi-qutrit gates generated by Weyl-Heisenberg strings
Daniele Trisciani, Marco Cattaneo, Zoltán Zimborás
Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two…
Will it glue? On short-depth designs beyond the unitary group
Lorenzo Grevink, Jonas Haferkamp, Markus Heinrich +4
We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Cliffo…
Simulation of Fermionic circuits using Majorana Propagation
Aaron Miller, Joachim Favre, Zoë Holmes +6
We introduce Majorana Propagation, an algorithmic framework for the classical simulation of Fermionic circuits. Inspired by Pauli Propagation, Majorana Propagation operates by appl…
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
Zoltán Zimborás, Bálint Koczor, Zoë Holmes +19
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transitio…