| Publication | Date of Publication | Type |
|---|
Quantum policy gradient algorithms
| 2024-11-20 | Paper |
Linear programming with unitary-equivariant constraints
Communications in Mathematical Physics | 2024-11-20 | Paper |
Quantum majority vote
| 2024-09-25 | Paper |
Efficient quantum circuits for port-based teleportation
| 2023-12-05 | Paper |
Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information
| 2023-10-03 | Paper |
Quantum-access security of the Winternitz one-time signature scheme
| 2023-07-03 | Paper |
Trading inverses for an irrep in the Solovay-Kitaev theorem
| 2023-04-26 | Paper |
Quantum majority vote
| 2022-11-21 | Paper |
On Quantum Chosen-Ciphertext Attacks and Learning with Errors
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559397 (Why is no real title available?)
| 2022-07-18 | Paper |
Proof tactics for a theory of state machines in a graphical environment
Automated Deduction—CADE-14 | 2019-10-01 | Paper |
Trading inverses for an irrep in the Solovay-Kitaev theorem
| 2017-12-28 | Paper |
The complexity of translationally invariant spin chains with low local dimension
Annales Henri Poincaré | 2017-12-01 | Paper |
scientific article; zbMATH DE number 6679846 (Why is no real title available?)
| 2017-02-01 | Paper |
Quantum rejection sampling
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Entropy power inequalities for qudits
Journal of Mathematical Physics | 2016-06-20 | Paper |
Quantum walks can find a marked element on any graph
Algorithmica | 2016-03-29 | Paper |
Quantum rejection sampling
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
How to combine three quantum states
| 2015-08-04 | Paper |
Everything you always wanted to know about LOCC (but were afraid to ask)
Communications in Mathematical Physics | 2014-05-30 | Paper |
Interpolatability distinguishes LOCC from separable von Neumann measurements
Journal of Mathematical Physics | 2014-04-17 | Paper |
A framework for bounding nonlocality of state discrimination
Communications in Mathematical Physics | 2013-11-11 | Paper |
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
Communications in Mathematical Physics | 2012-04-04 | Paper |
Characterization of universal two-qubit Hamiltonians
| 2011-10-05 | Paper |
Finding Is as Easy as Detecting for Quantum Walks
Automata, Languages and Programming | 2010-09-07 | Paper |
Improved constructions of mixed state quantum automata
Theoretical Computer Science | 2009-05-19 | Paper |
AI 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
Lecture Notes in Computer Science | 2005-08-17 | Paper |
scientific article; zbMATH DE number 1954129 (Why is no real title available?)
| 2003-07-28 | Paper |
scientific article; zbMATH DE number 1954189 (Why is no real title available?)
| 2003-07-28 | Paper |
scientific article; zbMATH DE number 1808267 (Why is no real title available?)
| 2002-09-26 | Paper |
scientific article; zbMATH DE number 1440051 (Why is no real title available?)
| 2001-08-20 | Paper |
scientific article; zbMATH DE number 1612512 (Why is no real title available?)
| 2001-07-01 | Paper |
Polynomial and term functions over groups with coprime chief factors
Monatshefte für Mathematik | 1990-01-01 | Paper |
