18 papers
Computing noise-canceling observables via Pauli propagation
Andrew Eddins, Caleb Johnson, Alberto Baiardi +8
The pursuit of quantum advantage is driving the co-evolution of quantum processors and classical simulation methods. Despite advances in scale and quality, the accuracy of quantum…
String dynamics of a (2+1)D U(1) quantum link model on a digital quantum computer
Anthony Gandon, Alessandro Mariani, Debasish Banerjee +5
The (2+1)D U(1) pure gauge theory always exists in the confining phase, with strings of non-zero string tension giving a characteristic linear potential between static charges. Thi…
Combining non-parametric quantum states and MERA tensor networks for ground-state optimization
Julian Schuhmacher, Alberto Baiardi, Francesco Tacchino +1
Hybrid tensor networks offer a promising route to enhance the expressivity of classical tensor network methods by incorporating quantum states prepared on a quantum computer. Exist…
Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
Sabri Meyer, Francesco Scala, Francesco Tacchino +1
Variational Quantum Algorithms are promising candidates for near-term quantum computing, yet they face scalability challenges due to barren plateaus, where gradients vanish exponen…
Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive
Marc Drudis, Alberto Baiardi, Mattia Chiurco +3
The preparation of quantum states is a fundamental requirement for many quantum algorithms. A native route to preparing physically structured states is based on short-time simulati…
A circuit-differentiation framework for Green's functions on quantum computers
Samuele Piccinelli, Francesco Tacchino, Ivano Tavernelli +1
We propose a general framework for computing Retarded Green's Functions (RGFs) on quantum computers by recasting their evaluation as a problem of circuit differentiation. Our propo…