Michael Walter

Orcid: 0000-0002-3073-1408

Affiliations:
  • Ruhr-University Bochum, Germany
  • University of Amsterdam, The Netherlands (former)


According to our database1, Michael Walter authored at least 40 papers between 2012 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Explicit non-free tensors.
CoRR, March, 2025

The moment polytope of matrix multiplication is not maximal.
CoRR, March, 2025

QbC: Quantum Correctness by Construction.
Proc. ACM Program. Lang., 2025

Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Permutation Superposition Oracles for Quantum Query Lower Bounds.
IACR Cryptol. ePrint Arch., 2024

A bound on the quantum value of all compiled nonlocal games.
IACR Cryptol. ePrint Arch., 2024

A Computational Tsirelson's Theorem for the Value of Compiled XOR Games.
IACR Cryptol. ePrint Arch., 2024

Compiled Nonlocal Games from any Trapdoor Claw-Free Function.
IACR Cryptol. ePrint Arch., 2024

Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness.
CoRR, 2024

Exponential Quantum One-Wayness and EFI Pairs.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
Non-Interactive Quantum Key Distribution.
IACR Cryptol. ePrint Arch., 2023

Weakening Assumptions for Publicly-Verifiable Deletion.
IACR Cryptol. ePrint Arch., 2023

A Simple Construction of Quantum Public-Key Encryption from Quantum-Secure One-Way Functions.
IACR Cryptol. ePrint Arch., 2023

Public-Key Encryption with Quantum Keys.
IACR Cryptol. ePrint Arch., 2023

Moment cone membership for quivers in strongly polynomial time.
CoRR, 2023

The minimal canonical form of a tensor network.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Interior-point methods on manifolds: theory and applications.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

(No) Quantum Space-Time Tradeoff for USTCON.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates.
Quantum, 2022

2021
Near optimal sample complexity for matrix and tensor normal models via geodesic convexity.
CoRR, 2021

Quantum Algorithms for Matrix Scaling and Matrix Balancing.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Polynomial Time Algorithms in Invariant Theory for Torus Actions.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
A Quantum Multiparty Packing Lemma and the Relay Channel.
IEEE Trans. Inf. Theory, 2020

Interior-point methods for unconstrained geometric programming and scaling problems.
CoRR, 2020

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Hyperpfaffians and Geometric Complexity Theory.
CoRR, 2019

Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes.
CoRR, 2019

Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Computation of dilated Kronecker coefficients.
J. Symb. Comput., 2018

Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Entanglement-Assisted Capacities of Compound Quantum Channels.
IEEE Trans. Inf. Theory, 2017

Membership in Moment Polytopes is in NP and coNP.
SIAM J. Comput., 2017

On vanishing of Kronecker coefficients.
Comput. Complex., 2017

2014
Lower Bounds for Quantum Parameter Estimation.
IEEE Trans. Inf. Theory, 2014

A Heisenberg limit for quantum region estimation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Stabilizer information inequalities from phase space distributions
CoRR, 2013

2012
Computing Multiplicities of Lie Group Representations.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012


  Loading...