default search action
"The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to ..."
Lennart Bittel, Sevag Gharibian, Martin Kliesch (2023)
- Lennart Bittel, Sevag Gharibian, Martin Kliesch:
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. CCC 2023: 34:1-34:24
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.