1. |
- Bengtsson, Andreas, 1991, et al.
(författare)
-
Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm
- 2020
-
Ingår i: Physical Review Applied. - 2331-7019. ; 14:3
-
Tidskriftsartikel (refereegranskat)abstract
- Present-day, noisy, small or intermediate-scale quantum processors-although far from fault tolerant-support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP (nondeterministic polynomial time)-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two.
|
|
2. |
- Yan, Fei, et al.
(författare)
-
Tunable Coupling Scheme for Implementing High-Fidelity Two-Qubit Gates
- 2018
-
Ingår i: Physical Review Applied. - 2331-7019. ; 10:5
-
Tidskriftsartikel (refereegranskat)abstract
- The prospect of computational hardware with quantum advantage relies critically on the quality of quantum-gate operations. Imperfect two-qubit gates are a major bottleneck for achieving scalable quantum-information processors. Here, we propose a generalizable and extensible scheme for a two-qubit tunable coupler that controls the qubit-qubit coupling by modulating the coupler frequency. Two-qubit gate operations can be implemented by operating the coupler in the dispersive regime, which is noninvasive to the qubit states. We investigate the performance of the scheme by simulating a universal two-qubit gate on a superconducting quantum circuit, and find that errors from known parasitic effects are strongly suppressed. The scheme is compatible with existing high-coherence hardware, thereby promising a higher gate fidelity with current technologies.
|
|