Maris Ozols

Affiliations:
  • Institute for Quantum Computing, University of Waterloo
  • University of Latvia, Riga, Latvia


According to our database1, Maris Ozols authored at least 22 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Quantum Majority Vote.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Quantum policy gradient algorithms.
CoRR, 2022

2021
Quantum-access security of the Winternitz one-time signature scheme.
IACR Cryptol. ePrint Arch., 2021

Exact quantum query complexity of computing Hamming weight modulo powers of two and three.
CoRR, 2021

2020
The Need for Structure in Quantum LDPC Codes.
IEEE Trans. Inf. Theory, 2020

On Quantum Chosen-Ciphertext Attacks and Learning with Errors.
Cryptogr., 2020

Span Programs and Quantum Time Complexity.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018
On non-adaptive quantum chosen-ciphertext attacks and Learning with Errors.
CoRR, 2018

Trading Inverses for an Irrep in the Solovay-Kitaev Theorem.
Proceedings of the 13th Conference on the Theory of Quantum Computation, 2018

2016
The Complexity of Translationally-Invariant Spin Chains with Low Local Dimension.
CoRR, 2016

Quantum Walks Can Find a Marked Element on Any Graph.
Algorithmica, 2016

2015
How to combine three quantum states.
CoRR, 2015

Entropy power inequalities for qudits.
CoRR, 2015

2013
Quantum rejection sampling.
ACM Trans. Comput. Theory, 2013

Bound entangled states with secret key and their classical counterpart
CoRR, 2013

Easy and Hard Functions for the Boolean Hidden Shift Problem.
Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

2011
Characterization of universal two-qubit Hamiltonians.
Quantum Inf. Comput., 2011

2010
Finding Is as Easy as Detecting for Quantum Walks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Improved constructions of mixed state quantum automata.
Theor. Comput. Sci., 2009

2006
Principles of Optimal Probabilistic Decision Tree Construction.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005
Size of Nondeterministic and Deterministic Automata for Certain Languages.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005


  Loading...