Scalable High-Performance Fluxonium Quantum Processor
- URL: http://arxiv.org/abs/2201.09374v2
- Date: Sat, 5 Feb 2022 07:05:53 GMT
- Title: Scalable High-Performance Fluxonium Quantum Processor
- Authors: Long B. Nguyen, Gerwin Koolstra, Yosep Kim, Alexis Morvan, Trevor
Chistolini, Shraddha Singh, Konstantin N. Nesterov, Christian J\"unger, Larry
Chen, Zahra Pedramrazi, Bradley K. Mitchell, John Mark Kreikebaum, Shruti
Puri, David I. Santiago, and Irfan Siddiqi
- Abstract summary: We propose a superconducting quantum information processor based on compact high-coherence fluxoniums with suppressed crosstalk.
We numerically investigate the cross resonance controlled-NOT and the differential AC-Stark controlled-Z operations, revealing low gate error for qubit-qubit detuning bandwidth of up to 1 GHz.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The technological development of hardware heading toward universal
fault-tolerant quantum computation requires a large-scale processing unit with
high performance. While fluxonium qubits are promising with high coherence and
large anharmonicity, their scalability has not been systematically explored. In
this work, we propose a superconducting quantum information processor based on
compact high-coherence fluxoniums with suppressed crosstalk, reduced design
complexity, improved operational efficiency, high-fidelity gates, and
resistance to parameter fluctuations. In this architecture, the qubits are
readout dispersively using individual resonators connected to a common bus and
manipulated via combined on-chip RF and DC control lines, both of which can be
designed to have low crosstalk. A multi-path coupling approach enables exchange
interactions between the high-coherence computational states and at the same
time suppresses the spurious static ZZ rate, leading to fast and high-fidelity
entangling gates. We numerically investigate the cross resonance controlled-NOT
and the differential AC-Stark controlled-Z operations, revealing low gate error
for qubit-qubit detuning bandwidth of up to 1 GHz. Our study on frequency
crowding indicates high fabrication yield for quantum processors consisting of
over thousands of qubits. In addition, we estimate low resource overhead to
suppress logical error rate using the XZZX surface code. These results promise
a scalable quantum architecture with high performance for the pursuit of
universal quantum computation.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Spatio-Temporal Characterization of Qubit Routing in
Connectivity-Constrained Quantum Processors [1.3230570759583702]
This work presents a comparative analysis of the resulting communication overhead among three processor topologies.
According to performance metrics of communication-to-computation ratio, mean qubit hotspotness, and temporal burstiness, the square lattice layout is favourable for quantum computer architectures at a scale.
arXiv Detail & Related papers (2024-02-01T10:16:04Z) - High-fidelity transmon coupler activated CCZ gate on fluxonium qubits [0.0]
We propose a novel way to perform a high-fidelity CCZ gate on fluxoniums capacitively connected via a transmon qubit, activated by a microwave pulse on the coupler.
We provide numerical simulation of 95-ns long gate of higher than 99.99% fidelity with realistic circuit parameters in the noiseless model and estimate an error of about 0.25% under the conventional decoherence rates.
arXiv Detail & Related papers (2023-08-29T11:36:19Z) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Optimal quantum control via genetic algorithms for quantum state
engineering in driven-resonator mediated networks [68.8204255655161]
We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms.
We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator.
We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
arXiv Detail & Related papers (2022-06-29T14:34:00Z) - Optimizing frequency allocation for fixed-frequency superconducting
quantum processors [0.0]
We propose a mixed-integer-programming-based optimization approach that determines qubit frequencies to maximize the fabrication yield of quantum processors.
Our approach is general and can be adapted to problems where one must avoid specific frequency collisions.
arXiv Detail & Related papers (2021-12-02T23:11:23Z) - Suppression of crosstalk in superconducting qubits using dynamical
decoupling [0.0]
Super superconducting quantum processors with interconnected transmon qubits are noisy and prone to various errors.
ZZ-coupling between qubits in fixed frequency transmon architectures is always present and contributes to both coherent and incoherent crosstalk errors.
We propose the use of dynamical decoupling to suppress the crosstalk, and demonstrate the success of this scheme through experiments on several IBM quantum cloud processors.
arXiv Detail & Related papers (2021-08-10T09:16:05Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Entangling Quantum Generative Adversarial Networks [53.25397072813582]
We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN)
We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
arXiv Detail & Related papers (2021-04-30T20:38:41Z) - Systematic Crosstalk Mitigation for Superconducting Qubits via
Frequency-Aware Compilation [3.2460743209388094]
One of the key challenges in current Noisy Intermediate-Scale Quantum (NISQ) computers is to control a quantum system with high-fidelity quantum gates.
We motivate a systematic approach for understanding and mitigating the crosstalk noise when executing near-term quantum programs on superconducting NISQ computers.
We present a general software solution to alleviate frequency crowding by systematically tuning qubit frequencies according to input programs.
arXiv Detail & Related papers (2020-08-21T14:35:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.