most citedA Lightweight Protocol for Matchgate Fidelity Estimation

1 citations · 1 across the 3 of their papers we have counts for

collaborators

9 papers

quant-ph2026

Structure, Positivity and Classical Simulability of Kirkwood-Dirac Distributions

Jędrzej Burkat, Sergii Strelchuk

Kirkwood-Dirac (KD) quasiprobability distributions are increasingly used across quantum information science, yet their computational significance remains unclear. We classify unita…

quant-ph20261 cited

A Lightweight Protocol for Matchgate Fidelity Estimation

Jędrzej Burkat, Sergii Strelchuk

We present a low-depth randomised protocol for estimating the entanglement fidelity between an -qubit matchgate circuit and its noisy implementation .…

quant-ph2026

Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States

Floyd M. Creevey, Hitham T. Hassan, James McCafferty +2

As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly impor…

quant-ph2026

Pangenome-guided sequence assembly via binary optimisation

Josh Cudby, James Bonfield, Chenxi Zhou +2

De novo genome assembly is challenging in highly repetitive regions; however, reference-guided assemblers often suffer from bias. We propose a framework for pangenome-guided sequen…

quant-ph2025

Toward Super-polynomial Quantum Speedup of Equivariant Quantum Algorithms with SU() Symmetry

Han Zheng, Zimu Li, Sergii Strelchuk +2

We introduce a framework of the equivariant convolutional quantum algorithms which is tailored for a number of machine-learning tasks on physical systems with arbitrary SU sym…

quant-ph2025

Parameterized quantum algorithms for closest string problems

Josh Cudby, Sergii Strelchuk

Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world app…