Executing Deep Optimization Algorithms on a Superconducting Quantum Processor with Andreas Wallraff
Speaker: Andreas Wallraff
Host: Zlatko Minev, Ph.D.
Title: Executing Deep Optimization Algorithms on a Superconducting Quantum Processor
Abstract: Superconducting circuits are a prime contender both for realizing fault-tolerant quantum processors and for executing noisy intermediate-scale quantum (NISQ) algorithms. After a brief introduction, I will discuss our implementation of quantum approximate optimization algorithms (QAOA), one of a whole class of variational algorithms which are believed to be promising to solve computationally hard problems on quantum computers. Such algorithms also emerge as a benchmark for the performance of NISQ-era quantum information processing systems. Gaining computational power from QAOA critically relies on the mitigation of errors during the execution of the algorithm, which for coherence-limited operations is achievable by reducing the gate count. Here, we present an improvement of up to a factor of three in algorithmic performance, by implementing a continuous hardware-efficient gate set. This gate set allows us to perform a critical step in QAOA with a single operation on each pair of qubits instead of decomposing it into multiple gates. We experimentally investigate the circuit-depth-dependent performance of our QAOA implementations for finding solutions to exact-cover problems mapped onto three or seven qubits using up to a total of 399 operations in up to 9 layers. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers [1]. In the same device architecture, we have recently demonstrated repeated error detection [2], an important step toward quantum error correction and the execution of fault-tolerant quantum algorithms.
References
[1] N. Lacroix et al., arXiv:2005.05275 (2020)
[2] C. K. Andersen et al., Nat. Phys. (2020). https://doi.org/10.1038/s41567-020-0920-y
--
The Quantum Computing Seminar Series is a deep dive into various academic and research topics within the quantum community. It will feature community members and leaders every Friday, 12 PM EDT.
Видео Executing Deep Optimization Algorithms on a Superconducting Quantum Processor with Andreas Wallraff канала Qiskit
Host: Zlatko Minev, Ph.D.
Title: Executing Deep Optimization Algorithms on a Superconducting Quantum Processor
Abstract: Superconducting circuits are a prime contender both for realizing fault-tolerant quantum processors and for executing noisy intermediate-scale quantum (NISQ) algorithms. After a brief introduction, I will discuss our implementation of quantum approximate optimization algorithms (QAOA), one of a whole class of variational algorithms which are believed to be promising to solve computationally hard problems on quantum computers. Such algorithms also emerge as a benchmark for the performance of NISQ-era quantum information processing systems. Gaining computational power from QAOA critically relies on the mitigation of errors during the execution of the algorithm, which for coherence-limited operations is achievable by reducing the gate count. Here, we present an improvement of up to a factor of three in algorithmic performance, by implementing a continuous hardware-efficient gate set. This gate set allows us to perform a critical step in QAOA with a single operation on each pair of qubits instead of decomposing it into multiple gates. We experimentally investigate the circuit-depth-dependent performance of our QAOA implementations for finding solutions to exact-cover problems mapped onto three or seven qubits using up to a total of 399 operations in up to 9 layers. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers [1]. In the same device architecture, we have recently demonstrated repeated error detection [2], an important step toward quantum error correction and the execution of fault-tolerant quantum algorithms.
References
[1] N. Lacroix et al., arXiv:2005.05275 (2020)
[2] C. K. Andersen et al., Nat. Phys. (2020). https://doi.org/10.1038/s41567-020-0920-y
--
The Quantum Computing Seminar Series is a deep dive into various academic and research topics within the quantum community. It will feature community members and leaders every Friday, 12 PM EDT.
Видео Executing Deep Optimization Algorithms on a Superconducting Quantum Processor with Andreas Wallraff канала Qiskit
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Many-Body Localization | Qiskit Quantum Seminar with David HuseLab 5 - Introduction to Hardware Efficient Ansatze for Quantum Machine LearningTransforming Quantum Circuits using Qiskit's Transpiler with Matthew Treinish: Qiskit Summer SchoolHow can I invert a unitary circuit? 1 Minute QiskitNick Knows - RoutingScalable, abstractable, retargetable & pluggable compilation | Qiskit Seminar Series with Ali JavadiBand Engineering for Quantum Simulation in Circuit QED | Qiskit Seminar Series with Alicia J. KollárTesting, linting and documentation in QiskitWhat is the difference between logical and physical qubits? - 1 Minute QiskitMonitored Quantum Circuits with Noncommuting Conserved Quantities | Qiskit Quantum SeminarQiskit Seminar Series with Mazyar Mirrahimi26. Quantum Chemistry II: Finding the Ground States of H2 and LiH - Part 2Understanding Noise in Near-Term Quantum Computers with Haimeng Zhang: Qiskit Summer School 2024Techniques for Finding Exact Solutions of Interacting Dissipative Quantum SystemsThe Power of Parametric Effects in Engineered Quantum Systems | Seminar Series with Anja MetelmannHow can I implement a multi control Toffoli gate? 1 Minute QiskitCoding with Qiskit Runtime | Episode 01 | Welcome!Coding with Qiskit Runtime | Episode 07 | Multiple Primitives for ResearchHow to open source your quantum research code.Quantum Simulations of Topological Majorana Modes with Oles Shtanko1 Minute Qiskit Question of the Month