387 citations · 2.2k across the 41 of their papers we have counts for
Showing 2022 · quant-phShow all
2 papers · 2 filters
quant-ph2022★ 1 cited
Complexity phase transitions in instantaneous quantum polynomial-time circuits
Chae-Yeun Park, Michael J. Kastoryano
We study a subclass of the Instantaneous Quantum Polynomial-time (IQP) circuit with a varying density of two-qubit gates. In addition to a known anticoncentration regime, we identi…
quant-ph2022★ 2 cited
A highly efficient tensor network algorithm for multi-asset Fourier options pricing
Michael Kastoryano, Nicola Pancotti
Risk assessment and in particular derivatives pricing is one of the core areas in computational finance and accounts for a sizeable fraction of the global computing resources of th…