Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to ..."

Lennart Bittel, Sevag Gharibian, Martin Kliesch (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CCC.2023.34

access: open

type: Conference or Workshop Paper

metadata version: 2023-07-10

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/coco/BittelGK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BittelGK23
Lennart Bittel, Sevag Gharibian, Martin Kliesch:
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. CCC 2023: 34:1-34:24

a service of

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.