Dmitry Grinko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dmitry Grinko has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Albert Rico
Universitat Autónoma de Barcelona
2 shared publications - Lin Htoo Zaw
National University of Singapore
2 shared publications - Maris Ozols
QuSoft, Amsterdam, the Netherlands
2 shared publications Adam Burchardt
QuSoft, Amsterdam, the Netherlands
1 shared publication- Christa Zoufal
IBM Quantum, IBM Research Europe-Zurich, Zurich, Switzerland.
1 shared publication - Denis Rochette
Institut de Mathématiques, Université de Toulouse, Toulouse, France
1 shared publication
Latest Publications
- Open Access
- 4 September 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (10) , 100203
Entanglement Structure and Matrix Inequalities from Isotypic Measurements
We detect entanglement partitions of multipartite quantum systems by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, m -separability, and entanglement depth are detected as very special cases. This formulation enables us to characterize all entanglement partitions of all three- and four-partite states and witnesses with unitary and permutation symmetry, which we denote Schur-Weyl isotypic witnesses. In particular, we find and parametrize a complete set of bound entangled states therein. For larger systems, we provide a large family of analytical witnesses detecting multipartite states of arbitrary size where none of the parties is separable from the rest. The proposed method relies on weak Schur sampling with projective measurements onto isotypic components and can be implemented in a quantum computer. Beyond physics, our results extend to the mathematical literature: we establish new inequalities between matrix immanants, which constitute an open problem, and characterize the set of such inequalities for matrices of sizes three and four.
- 4 September 2026
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 137 (10) , 100203
Open AccessEntanglement Structure and Matrix Inequalities from Isotypic Measurements
We detect entanglement partitions of multipartite quantum systems by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, m -separability, and entanglement depth are detected as very special cases. This formulation enables us to characterize all entanglement partitions of all three- and four-partite states and witnesses with unitary and permutation symmetry, which we denote Schur-Weyl isotypic witnesses. In particular, we find and parametrize a complete set of bound entangled states therein. For larger systems, we provide a large family of analytical witnesses detecting multipartite states of arbitrary size where none of the parties is separable from the rest. The proposed method relies on weak Schur sampling with projective measurements onto isotypic components and can be implemented in a quantum computer. Beyond physics, our results extend to the mathematical literature: we establish new inequalities between matrix immanants, which constitute an open problem, and characterize the set of such inequalities for matrices of sizes three and four.
- 21 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2343-2357
Entanglement Recycling in Two-Step Port-Based Teleportation
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-called two-step PBT, namely enatnglement fidelity and success probability are provided for two scenarios, relying on application of pretty-good measurement, i.e. deterministic and probabilistic PBT with non-EPR resource. This results show that two-step PBT is an accurate protocol, provided the resource is sufficiently large. In particular, the deterministic two-step PBT obtains fidelity that is remarkably close to the optimal MPBT fidelity for teleportation of two quantum states. Additionally, the recycling fidelity, i.e. the quantity characterizing the degradation of the resource state is calculated for repetitive application of probabilistic protocol, for both EPR and optimized resource, showing that entanglement recycling with two-step PBT is possible in the former case as well.
- 21 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (4) , 2343-2357
Entanglement Recycling in Two-Step Port-Based Teleportation
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-called two-step PBT, namely enatnglement fidelity and success probability are provided for two scenarios, relying on application of pretty-good measurement, i.e. deterministic and probabilistic PBT with non-EPR resource. This results show that two-step PBT is an accurate protocol, provided the resource is sufficiently large. In particular, the deterministic two-step PBT obtains fidelity that is remarkably close to the optimal MPBT fidelity for teleportation of two quantum states. Additionally, the recycling fidelity, i.e. the quantity characterizing the degradation of the resource state is calculated for repetitive application of probabilistic protocol, for both EPR and optimized resource, showing that entanglement recycling with two-step PBT is possible in the former case as well.
- 8 December 2025
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 407 (1) , 21
Monogamy of Highly Symmetric States
- 8 December 2025
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 407 (1) , 21
Monogamy of Highly Symmetric States
- Open Access
Detection of many-body entanglement partitions in a quantum computer
We present a method to detect entanglement partitions of multipartite quantum systems, by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, $m$-separability and entanglement depth are detected as very special cases. This formulation enables us to characterize all the entanglement partitions of all three- and four- partite states and witnesses with unitary and permutation symmetry. In particular, we find and parametrize a complete set of bound entangled states therein. For larger systems, we provide a large family of analytical witnesses detecting many-body states of arbitrary size where none of the parties is separable from the rest. This method relies on weak Schur sampling with projective measurements, and thus can be implemented in a quantum computer. Beyond physics, our results extend to the mathematical literature: we establish new inequalities between matrix immanants, and characterize the set of such inequalities for matrices of size three and four.
Open AccessDetection of many-body entanglement partitions in a quantum computer
We present a method to detect entanglement partitions of multipartite quantum systems, by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, $m$-separability and entanglement depth are detected as very special cases. This formulation enables us to characterize all the entanglement partitions of all three- and four- partite states and witnesses with unitary and permutation symmetry. In particular, we find and parametrize a complete set of bound entangled states therein. For larger systems, we provide a large family of analytical witnesses detecting many-body states of arbitrary size where none of the parties is separable from the rest. This method relies on weak Schur sampling with projective measurements, and thus can be implemented in a quantum computer. Beyond physics, our results extend to the mathematical literature: we establish new inequalities between matrix immanants, and characterize the set of such inequalities for matrices of size three and four.
- 14 November 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (20) , 200201
Compatibility of Binary Qubit Measurements
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 perspective, but also has direct applications in quantum correlation problems fueled by incompatible measurements. Although central, only a few analytical criteria exist for deciding the incompatibility of general sets of measurements. This Letter approaches the problem through functions defined on the Boolean hypercube and their Fourier transformations. We show that this reformulation of the problem leads to a complete geometric characterization of joint measurability of any finite set of unbiased binary qubit measurements and gives a necessary condition for the biased case. We discuss our results in the realm of quantum steering, where they translate into a family of steering inequalities. When certain unbiasedness conditions are fulfilled, these criteria are tight, hence fully characterizing the steering problem when the trusted party holds a qubit, and the untrusted party performs any finite number of binary measurements. We further discuss how our results point towards a second-order cone programming approach to measurement incompatibility and compare this to the predominantly used semi-definite programming-based techniques. We use our approach to falsify an existing conjecture on measurement incompatibility of special sets of measurements.
- 14 November 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (20) , 200201
Compatibility of Binary Qubit Measurements
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 perspective, but also has direct applications in quantum correlation problems fueled by incompatible measurements. Although central, only a few analytical criteria exist for deciding the incompatibility of general sets of measurements. This Letter approaches the problem through functions defined on the Boolean hypercube and their Fourier transformations. We show that this reformulation of the problem leads to a complete geometric characterization of joint measurability of any finite set of unbiased binary qubit measurements and gives a necessary condition for the biased case. We discuss our results in the realm of quantum steering, where they translate into a family of steering inequalities. When certain unbiasedness conditions are fulfilled, these criteria are tight, hence fully characterizing the steering problem when the trusted party holds a qubit, and the untrusted party performs any finite number of binary measurements. We further discuss how our results point towards a second-order cone programming approach to measurement incompatibility and compare this to the predominantly used semi-definite programming-based techniques. We use our approach to falsify an existing conjecture on measurement incompatibility of special sets of measurements.
- Open Access
- 7 April 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (2)
Bosonic Randomized Benchmarking with Passive Transformations
Randomized benchmarking (RB) is the most commonly employed protocol for the characterization of unitary operations in quantum circuits due to its reasonable experimental requirements and robustness against state preparation and measurement (SPAM) errors. So far, the protocol has been limited to discrete or fermionic systems, whereas extensions to bosonic systems have been unclear for a long time due to challenges arising from the underlying bosonic Hilbert space. In this work, we close the gap for bosonic systems and develop an RB protocol to benchmark passive Gaussian transformations on any particle-number subspace, which we call . The protocol is built on top of the recently developed filtered RB framework [J. Helsen , PRX Quantum 3, 020357 (2022), M. Heinrich , Randomized benchmarking with random quantum circuits, arxiv:2212.06181 [quant-ph]] and is designed to isolate the multitude of exponential decays arising for passive bosonic transformations. We give explicit formulas and a Julia implementation for the necessary postprocessing of the experimental data. We also analyze the sampling complexity of passive bosonic RB by deriving analytical expressions for the variance. They show a mild scaling with the number of modes, suggesting that passive bosonic RB is experimentally feasible for a moderate number of modes. We focus on experimental settings involving Fock states and particle-number-resolving measurements, but also discuss Gaussian settings, deriving the first results for heterodyne measurements.
- 7 April 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (2)
Open AccessBosonic Randomized Benchmarking with Passive Transformations
Randomized benchmarking (RB) is the most commonly employed protocol for the characterization of unitary operations in quantum circuits due to its reasonable experimental requirements and robustness against state preparation and measurement (SPAM) errors. So far, the protocol has been limited to discrete or fermionic systems, whereas extensions to bosonic systems have been unclear for a long time due to challenges arising from the underlying bosonic Hilbert space. In this work, we close the gap for bosonic systems and develop an RB protocol to benchmark passive Gaussian transformations on any particle-number subspace, which we call . The protocol is built on top of the recently developed filtered RB framework [J. Helsen , PRX Quantum 3, 020357 (2022), M. Heinrich , Randomized benchmarking with random quantum circuits, arxiv:2212.06181 [quant-ph]] and is designed to isolate the multitude of exponential decays arising for passive bosonic transformations. We give explicit formulas and a Julia implementation for the necessary postprocessing of the experimental data. We also analyze the sampling complexity of passive bosonic RB by deriving analytical expressions for the variance. They show a mild scaling with the number of modes, suggesting that passive bosonic RB is experimentally feasible for a moderate number of modes. We focus on experimental settings involving Fock states and particle-number-resolving measurements, but also discuss Gaussian settings, deriving the first results for heterodyne measurements.
- Top Cited PapersOpen Access
- 6 November 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (12) , 1-72
Linear Programming with Unitary-Equivariant Constraints
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 programs for a $$d^{p+q}$$ -dimensional matrix variable that commutes with $$U^{\otimes p} \otimes {\bar{U}}^{\otimes q}$$ , for all $$U \in \textrm{U}(d)$$ . Solving such problems naively can be prohibitively expensive even if $$p+q$$ is small but the local dimension d is large. We show that, under additional symmetry assumptions, this problem reduces to a linear program that can be solved in time that does not scale in d, and we provide a general framework to execute this reduction under different types of symmetries. The key ingredient of our method is a compact parametrization of the solution space by linear combinations of walled Brauer algebra diagrams. This parametrization requires the idempotents of a Gelfand–Tsetlin basis, which we obtain by adapting a general method inspired by the Okounkov–Vershik approach. To illustrate potential applications of our framework, we use several examples from quantum information: deciding the principal eigenvalue of a quantum state, quantum majority vote, asymmetric cloning and transformation of a black-box unitary. We also outline a possible route for extending our method to general unitary-equivariant semidefinite programs.- 6 November 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (12) , 1-72
Top Cited PapersOpen AccessLinear Programming with Unitary-Equivariant Constraints
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 programs for a $$d^{p+q}$$ -dimensional matrix variable that commutes with $$U^{\otimes p} \otimes {\bar{U}}^{\otimes q}$$ , for all $$U \in \textrm{U}(d)$$ . Solving such problems naively can be prohibitively expensive even if $$p+q$$ is small but the local dimension d is large. We show that, under additional symmetry assumptions, this problem reduces to a linear program that can be solved in time that does not scale in d, and we provide a general framework to execute this reduction under different types of symmetries. The key ingredient of our method is a compact parametrization of the solution space by linear combinations of walled Brauer algebra diagrams. This parametrization requires the idempotents of a Gelfand–Tsetlin basis, which we obtain by adapting a general method inspired by the Okounkov–Vershik approach. To illustrate potential applications of our framework, we use several examples from quantum information: deciding the principal eigenvalue of a quantum state, quantum majority vote, asymmetric cloning and transformation of a black-box unitary. We also outline a possible route for extending our method to general unitary-equivariant semidefinite programs. - Top Cited PapersOpen Access
- 19 March 2021
- Published by Springer Nature in npj Quantum Information
- Vol. 7 (1) , 1-6
Iterative quantum amplitude estimation
We introduce a 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 Algorithm, which reduces the required number of qubits and gates. We provide a rigorous analysis of IQAE and prove that it achieves a quadratic speedup up to a double-logarithmic factor compared to classical Monte Carlo simulation with provably small constant overhead. Furthermore, we show with an empirical study that our algorithm outperforms other known QAE variants without QPE, some even by orders of magnitude, i.e., our algorithm requires significantly fewer samples to achieve the same estimation accuracy and confidence level.
- 19 March 2021
- Published by Springer Nature in npj Quantum Information
- Vol. 7 (1) , 1-6
Top Cited PapersOpen AccessIterative quantum amplitude estimation
We introduce a 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 Algorithm, which reduces the required number of qubits and gates. We provide a rigorous analysis of IQAE and prove that it achieves a quadratic speedup up to a double-logarithmic factor compared to classical Monte Carlo simulation with provably small constant overhead. Furthermore, we show with an empirical study that our algorithm outperforms other known QAE variants without QPE, some even by orders of magnitude, i.e., our algorithm requires significantly fewer samples to achieve the same estimation accuracy and confidence level.