activity
20172025
most citedEfficient variational contraction of two-dimensional tensor networks with a non-trivial unit cell

22 citations · 51 across the 13 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

quant-ph2023★ 1 cited

Hamiltonian truncation tensor networks for quantum field theories

Philipp Schmoll, Jan Naumann, Alexander Nietner +2

Understanding the equilibrium properties and out of equilibrium dynamics of quantum field theories are key aspects of fundamental problems in theoretical particle physics and cosmo…

quant-ph2023★ 2 cited

Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms

Alexander Nietner

Kearns' statistical query (SQ) oracle (STOC'93) lends a unifying perspective for most classical machine learning algorithms. This ceases to be true in quantum learning, where many…

quant-ph2023★ 2 cited

Classical Verification of Quantum Learning

Matthias C. Caro, Marcel Hinsche, Marios Ioannou +2

Quantum data access and quantum processing can make certain classically intractable learning tasks feasible. However, quantum capabilities will only be available to a select few in…

quant-ph2023★ 1 cited

Free Fermion Distributions Are Hard to Learn

Alexander Nietner

Free fermions are some of the best studied quantum systems. However, little is known about the complexity of learning free-fermion distributions. In this work we establish the hard…

quant-ph2023★ 4 cited

On the average-case complexity of learning output distributions of quantum circuits

Alexander Nietner, Marios Ioannou, Ryan Sweke +4

In this work, we show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely…