On the role of entanglement in qudit-based circuit compression
- URL: http://arxiv.org/abs/2209.14584v2
- Date: Wed, 11 Oct 2023 20:18:35 GMT
- Title: On the role of entanglement in qudit-based circuit compression
- Authors: Xiaoqin Gao, Paul Appel, Nicolai Friis, Martin Ringbauer, Marcus Huber
- Abstract summary: Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, and two-qubit entangling gates.
We show how the complexity of multi-qubit circuits can be lowered significantly by employing qudit encodings.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Gate-based universal quantum computation is formulated in terms of two types
of operations: local single-qubit gates, which are typically easily
implementable, and two-qubit entangling gates, whose faithful implementation
remains one of the major experimental challenges since it requires controlled
interactions between individual systems. To make the most of quantum hardware
it is crucial to process information in the most efficient way. One promising
avenue is to use higher-dimensional systems, qudits, as the fundamental units
of quantum information, in order to replace a fraction of the qubit-entangling
gates with qudit-local gates. Here, we show how the complexity of multi-qubit
circuits can be lowered significantly by employing qudit encodings, which we
quantify by considering exemplary circuits with exactly known (multi-qubit)
gate complexity. We discuss general principles for circuit compression, derive
upper and lower bounds on the achievable advantage, and highlight the key role
played by entanglement and the available gate set. Explicit experimental
schemes for photonic as well as for trapped-ion implementations are provided
and demonstrate a significant expected gain in circuit performance for both
platforms.
Related papers
- Multi-controlled single-qubit unitary gates based on the quantum Fourier transform [0.0]
Multi-controlled (MC) unitary (U) gates are widely employed in quantum algorithms and circuits.
Few state-of-the-art decompositions of MCU gates use non-elementary $C-R_x$ and $C-U1/2m-1$ gates.
Our approach is based on two generalizations of the multi-controlled X (MCX) gate.
arXiv Detail & Related papers (2024-08-01T21:56:02Z) - Implementing multi-controlled X gates using the quantum Fourier transform [0.0]
We show how a quantum arithmetic-based approach can be efficiently used to implement many complex quantum gates.
We show how the depth of the circuit can be significantly reduced using only a few ancilla qubits.
arXiv Detail & Related papers (2024-07-25T13:22:00Z) - Realization of Scalable Cirac-Zoller Multi-Qubit Gates [5.309268373861329]
The universality in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits.
Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits.
Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.
arXiv Detail & Related papers (2023-01-18T14:34:24Z) - Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor.
We propose a universal gate set featuring a two-qudit cross-resonance entangling gate.
We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z) - Fast and Robust Geometric Two-Qubit Gates for Superconducting Qubits and
beyond [0.0]
We propose a scheme to realize robust geometric two-qubit gates in multi-level qubit systems.
Our scheme is substantially simpler than STIRAP-based gates that have been proposed for atomic platforms.
We show how our gate can be accelerated using a shortcuts-to-adiabaticity approach.
arXiv Detail & Related papers (2022-08-08T16:22:24Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Circuit connectivity boosts by quantum-classical-quantum interfaces [0.4194295877935867]
High-connectivity circuits are a major roadblock for current quantum hardware.
We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders.
We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits.
arXiv Detail & Related papers (2022-03-09T19:00:02Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - 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) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.