"Analog Quantum Computing for NP-Hard Combinatorial Graph Problems. (Calcul ..."

Arthur Braida (2024)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2024-11-14

- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - phd/hal/Braida24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Braida24
Arthur Braida:
Analog Quantum Computing for NP-Hard Combinatorial Graph Problems. (Calcul analogique quantique pour des problèmes combinatoires sur graphes NP-difficile). University of Orléans, France, 2024

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.