2022
DOI: 10.1007/978-3-031-21867-5_7
|View full text |Cite
|
Sign up to set email alerts
|

QPU-System Co-design for Quantum HPC Accelerators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 31 publications
0
6
0
Order By: Relevance
“…The circuit runtime also has to be compared to the coherence time of the qubits: while the gate execution times on other platforms such as trapped ions or cold atoms are in general longer than for superconducting QPUs such as the IBM-Q device considered here, those platforms usually also feature longer coherence times. Moreover, realizations based on ions or atoms exhibit better connectivity between the qubits which in turn reduces the amount of gates needed to run the circuit on the QPU and thus also reduces the amount of noise introduced on NISQ-devices [36]. Eventually, the absolute values of the runtimes have to be judged along with the quality of the delivered results within the specific context of the application.…”
Section: Results From Annealingmentioning
confidence: 99%
See 1 more Smart Citation
“…The circuit runtime also has to be compared to the coherence time of the qubits: while the gate execution times on other platforms such as trapped ions or cold atoms are in general longer than for superconducting QPUs such as the IBM-Q device considered here, those platforms usually also feature longer coherence times. Moreover, realizations based on ions or atoms exhibit better connectivity between the qubits which in turn reduces the amount of gates needed to run the circuit on the QPU and thus also reduces the amount of noise introduced on NISQ-devices [36]. Eventually, the absolute values of the runtimes have to be judged along with the quality of the delivered results within the specific context of the application.…”
Section: Results From Annealingmentioning
confidence: 99%
“…In order to assess the performance of each quantum algorithm and provide a meaningful comparison with the results from quantum annealing, we estimate the runtimes for standard QAOA and VQE on a quantum processing unit (QPU). A simple model to describe the total runtime T of a variational quantum algorithm is explained in [36] and reads:…”
Section: Runtime Estimation On Quantum Devices For Qaoa and Vqementioning
confidence: 99%
“…The quantum operations are embedded into a classical optimisation loop; after applying the unitary operators to an initial state, the expectation value of the circuit, which represents the problem Hamiltonian and encodes the objective function, is measured. Using a classical optimiser, circuit parameters are changed to minimise the expectation value [4].…”
Section: Quantum Approximate Optimisation Algorithm (Qaoa)mentioning
confidence: 99%
“…[4], the total execution time for a hybrid algorithm, such as QAOA, comprises several contributions, for instance, circuit execution time, the classical parameter optimisation time, the number of samples required to obtain accurate statistics, or the communication time between the classical computer and the QPU involved. Wintersperger et al [4] compared three different QPU deployment scenarios: (1) having the QPU in the cloud, which is a popular access model for QC vendors, (2) connecting the QPU to the classical CPU via a local bus, and (3) an on-chip QPU-CPU integration. Although the on-chip scenario is associated with the shortest communication time between QPU and CPU, the total execution time improvements over the local bus scenario can be neglected.…”
Section: Latency and Integrationmentioning
confidence: 99%
See 1 more Smart Citation