Shaohan Hu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Peng Liu 0010

> Home > Persons > Shaohan Hu

Publications

2020
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/icst/Pistoia0CHW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icst/Pistoia0CHW20
Marco Pistoia, Peng Liu, Chun-Fu (Richard) Chen, Shaohan Hu, Stephen P. Wood:
Parallelization of Classical Numerical optimization in Quantum Variational Algorithms. ICST 2020: 309-320
2019
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/computer/HuLCPG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computer/HuLCPG19
Shaohan Hu, Peng Liu, Chun-Fu (Richard) Chen, Marco Pistoia, Jay M. Gambetta:
Reduction-Based Problem Mapping for Quantum Computing. Computer 52(6): 47-57 (2019)
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/computer/LiuHPCG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computer/LiuHPCG19
Peng Liu, Shaohan Hu, Marco Pistoia, Chun-Fu (Richard) Chen, Jay M. Gambetta:
Stochastic Optimization of Quantum Programs. Computer 52(6): 58-67 (2019)
2018
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/icse/Hu0CP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icse/Hu0CP18
Shaohan Hu, Peng Liu, Chun-Fu (Richard) Chen, Marco Pistoia:
Automatically solving NP-complete problems on a quantum computer. ICSE (Companion Volume) 2018: 258-259

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.