Natalie Parham

Orcid: 0000-0002-8792-1229

According to our database1, Natalie Parham authored at least 7 papers between 2021 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Quantum Circuit Lower Bounds in the Magic Hierarchy.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Magic and Communication Complexity.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Unconditional Quantum Advantage for Sampling with Shallow Circuits.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

Random Unitaries in Constant (Quantum) Time.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

Identity Check Problem for Shallow Quantum Circuits.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2024
On the Pauli Spectrum of QAC0.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2021
Quantum Optimization Heuristics with an Application to Knapsack Problems.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2021


  Loading...