collaborators

14 papers

quant-ph2026

Sample complexity of quantum resource testing via one-shot quantum blurring

Dmitry Grinko, Ludovico Lami

Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate copies of a gi…

quant-ph2026

Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms

Dmitry Grinko, Satoshi Yoshida

We construct exact compressed oracles for Haar-random group actions associated with an arbitrary finite-dimensional unitary representation of a compact group. The construction is a…

quant-ph2026

Quantum Programmable Reflections

Eddie Schoute, Dmitry Grinko, Yigit Subasi +1

Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed qu…

quant-ph2026

Sequential quantum processes with group symmetries

Dmitry Grinko, Satoshi Yoshida, Mio Murao +1

Symmetry plays a crucial role in the design and analysis of quantum protocols. This result shows a canonical circuit decomposition of a -invariant quantum comb for com…

quant-ph2026

Permutation tests for quantum state identity

Harry Buhrman, Dmitry Grinko, Philip Verduyn Lunel +1

The quantum analogue of the equality function, known as the quantum state identity problem, is the task of deciding whether unknown quantum states are equal or unequal, given t…

quant-ph2026

Classical shadows with arbitrary group representations

Maxwell West, Frederic Sauvage, Aniruddha Sen +6

Classical shadows (CS) has recently emerged as an important framework to efficiently predict properties of an unknown quantum state. A common strategy in CS protocols is to paramet…