2022
DOI: 10.1103/physreva.106.042446
|View full text |Cite
|
Sign up to set email alerts
|

Approximating the quantum approximate optimization algorithm with digital-analog interactions

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
10
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 51 publications
0
10
0
Order By: Relevance
“…This report explores the possibility of factoring larger numbers with compressed algorithms in given quantum computers, rather than proving any scalability of computational resources. On the other hand, further use of analog [3,4] or digital-analog encoding schemes [5][6][7] may pave the way towards factoring RSA-2048 in the NISQ era, without the long wait for faulttolerant quantum computers.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…This report explores the possibility of factoring larger numbers with compressed algorithms in given quantum computers, rather than proving any scalability of computational resources. On the other hand, further use of analog [3,4] or digital-analog encoding schemes [5][6][7] may pave the way towards factoring RSA-2048 in the NISQ era, without the long wait for faulttolerant quantum computers.…”
mentioning
confidence: 99%
“…Going beyond that with current digital quantum computers, for given gate fidelities and coherence times, looks like a challenging task. However, alternative approaches like digital-analog quantum computing, involving multiqubit analog blocks in combination with local digital steps, might tackle RSA-2048, bringing quantum advantage to the NISQ era [5][6][7]. Moreover, one could also consider this problem on programmable analog quantum simulators, like neutral atom devices [4,18], with Floquet engineering techniques.…”
mentioning
confidence: 99%
“…However, implementing high-depth QAOA circuits can be impractical experimentally due to various sources of noise [62]. Therefore, improving QAOA with low-depth circuits has been actively pursued [63][64][65].…”
Section: Meta-learning Dc-qaoamentioning
confidence: 99%
“…There is another paradigm called banged DAQC (bDAQC) in which the interaction Hamiltonian is never switched off and single-qubit rotations (SQR's) are applied on top of the analog dynamics. This introduces an inherent error, since it does not implement the exact algorithm, but when experimental errors are taken into account, it happens to scale up better than sDAQC and DQC [10,11,22]. This intuitively holds when the application time of SQRs, ∆t, is much smaller than the time scale of the analog blocks, so the error introduced is smaller than the one coming from switching on and off the Hamiltonian in sDAQC.…”
Section: Digital-analog Quantum Computingmentioning
confidence: 99%