Hay from the haystack: explicit examples of exponential quantum circuit complexity

DOI10.1007/s00220-023-04720-xzbMath1529.81044arXiv2205.06977OpenAlexW4375845706MaRDI QIDQ6109366

No author found.

Publication date: 28 July 2023

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.06977

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Algebraic independence; Gel'fond's method (11J85) Two-body problems (70F05) Matrix models and tensor models for quantum field theory (81T32) Quantum gates (81P65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Random walks in compact groups
• A Boolean function requiring 3n network size
• Grands degrés de transcendance pour des familles d'exponentielles. (Large transcendence degrees for families of exponentials)
• An application of Galois theory to elementary arithmetic
• Lower bounds for polynomial evaluation and interpolation problems
• Algebraic independence criteria.
• Computational complexity and black hole horizons
• A Lower Bound for the Formula Size of Rational Functions
• Efficient discrete approximations of quantum gates
• Epsilon-Nets, Unitary Designs, and Random Quantum Circuits
• Transcendental Numbers

This page was built for publication: Hay from the haystack: explicit examples of exponential quantum circuit complexity