198 citations · 210 across the 23 of their papers we have counts for
23 papers · 1 filter
Approximate cloning of structured pure states
Yaroslav Herasymenko, Junqiao Lin, Philip Verduyn Lunel +1
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information. More quantitatively, even given copies of an unknown st…
Quantum Fourier transform toolbox
Carli Bruinsma, Pietro M. Posta, Joppe Stokvis +2
Quantum Fourier transforms (QFTs) are essential primitives in quantum algorithms. While abelian groups admit efficient QFT circuits, with circuit size polynomial in the logarithm o…
Quantum Fourier transform for the symmetric group
Carli Bruinsma, Dmitry Grinko, Maris Ozols
Quantum Fourier transforms (QFT) for general groups were recognized to be fundamental already early in the field. A canonical example of non-abelian QFT for the symmetric group was…
Optimal cloning of mixed states
Marco Fanizza, Dmitry Grinko, Thilo Scharnhorst +1
We consider the problem of approximate cloning of quantum states: given copies of an unknown state , prepare an -copy state with high fidel…
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…
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…
Stronger Welch Bounds and Optimal Approximate -Designs
Riccardo Castellano, Dmitry Grinko, Sadra Boreiri +2
The question of how well a finite ensemble of quantum states can approximate Haar randomness is relevant in many areas of quantum physics. Here we consider this problem from a geom…
Detection of many-body entanglement partitions in a quantum computer
Albert Rico, Dmitry Grinko, Robin Krebs +1
We present a method to detect entanglement partitions of multipartite quantum systems, by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement,…
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…
High-dimensional quantum Schur transforms
Adam Burchardt, Jiani Fei, Dmitry Grinko +4
The quantum Schur transform has become a foundational quantum algorithm, yet even after two decades since the seminal 2005 paper by Bacon, Chuang, and Harrow (BCH), some aspects of…
Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
Amira Abbas, Nunzia Cerrato, Francisco Escudero Gutiérrez +3
We study the problem of learning Hamiltonians that are -sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively i…
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…
Entanglement recycling in two-step port-based teleportation
Piotr Kopszak, Dmitry Grinko, Adam Burchardt +3
A protocol involving the repetitive (twofold, to be precise) application of PBT protocol to the same resource is studied. The quantities characterizing the resulting protocol, so-c…
Group-Adapted Irreducible Matrix Units for the Walled Brauer Algebra
Michał Studziński, Tomasz Młynik, Marek Mozrzymas +2
This paper investigates the representation theory of the algebra of partially transposed permutation operators, , which provides a matrix representation for th…
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…
Bosonic randomized benchmarking with passive transformations
Mirko Arienzo, Dmitry Grinko, Martin Kliesch +1
Randomized benchmarking (RB) is the most commonly employed protocol for the characterization of unitary operations in quantum circuits due to its reasonable experimental requiremen…
On compatibility of binary qubit measurements
Dmitry Grinko, Roope Uola
Deciding which sets of quantum measurements allow a simultaneous readout is a central problem in quantum measurement theory. The problem is relevant not only from the foundational…
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…
Efficient quantum circuits for port-based teleportation
Dmitry Grinko, Adam Burchardt, Maris Ozols
Port-based teleportation (PBT) is a variant of quantum teleportation that, unlike the canonical protocol by Bennett et al., does not require a correction operation on the teleporte…
Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information
Dmitry Grinko, Adam Burchardt, Maris Ozols
We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a promi…
Monogamy of highly symmetric states
Rene Allerstorfer, Matthias Christandl, Dmitry Grinko +4
We investigate the extent to which two particles can be maximally entangled when they are also similarly entangled with other particles on a complete graph, focusing on Werner, iso…
Linear programming with unitary-equivariant constraints
Dmitry Grinko, Maris Ozols
Unitary equivariance is a natural symmetry that occurs in many contexts in physics and mathematics. Optimization problems with such symmetry can often be formulated as semidefinite…
Iterative Quantum Amplitude Estimation
Dmitry Grinko, Julien Gacon, Christa Zoufal +1
We introduce a new variant of Quantum Amplitude Estimation (QAE), called Iterative QAE (IQAE), which does not rely on Quantum Phase Estimation (QPE) but is only based on Grover's A…