Let Each Quantum Bit Choose Its Basis Gates

Lin, Sophia Fuhui; Sussman, Sara; Duckering, Casey; Mundada, Pranav; Baker, Jonathan M.; Kumar, Rohan; Houck, Andrew; Chong, Frederic T.

doi:10.1109/micro56248.2022.00075

Cited by 5 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Swap gate: Swap gates are used in quantum algorithms for reordering and swapping quantum states, such as in quantum sorting and quantum data permutation [98][99][100].…”

Section: Applications Of Reversible Logic Gatesmentioning

confidence: 99%

Reversible Logic Gates and Applications – A Low Power Solution to VLSI Chips

Tiwari,

Kadam,

Dudhedia

et al. 2024

MMEP

View full text Add to dashboard Cite

In recent years, reversible logic gates have garnered significant interest because of their potential to decrease energy consumption and meet the growing need for low-power computing systems. Unlike conventional logic gates, reversible logic gates ensure that no information loss happens during computation, allowing for the reversal of the entire computation process. This unique characteristic opens up new avenues for developing energy-efficient digital circuits. This review paper serves as a vital contribution to the field by addressing a noticeable gap in the existing literature regarding reversible logic gates. The study not only comprehensively analyzes the array of reversible logic gates available but also underscores their practical applications and significance. It encompasses a wide variety of reversible logic gates, including Toffoli gates, Fredkin gates, and newer innovations. It is found that Toffoli gates outperformed in terms of gate count and quantum cost reduction, making them a preferred choice for quantum circuit optimization. Additionally, Fredkin gates showed exceptional performance in specific applications, like data swapping and quantum state control. The digital circuits like adders, multiplexers, ALU etc. are successfully designed using reversible gates like HNG, DKG etc. The significant gap this study fills lies in the need for a consolidated and in-depth analysis of the state-of-the-art reversible logic gates and their real-world utility. While prior research has discussed these gates individually, this paper takes a novel approach by offering a holistic assessment of their performance, quantum cost, gate count, and practical applications, thereby presenting a comprehensive resource for researchers, engineers, and designers in the field. This innovative contribution plays a pivotal role in shaping the progress of energy-efficient and quantum computing systems as well as in optimizing VLSI chip designs for various applications, with a particular emphasis on enhancing cryptographic and data processing capabilities. The findings of this review aim to stimulate further research and development in reversible computing, contributing to the advancement of energy-efficient and information-preserving computing systems.

show abstract

“…Swap gate: Swap gates are used in quantum algorithms for reordering and swapping quantum states, such as in quantum sorting and quantum data permutation [98][99][100].…”

Section: Applications Of Reversible Logic Gatesmentioning

confidence: 99%

Reversible Logic Gates and Applications – A Low Power Solution to VLSI Chips

Tiwari,

Kadam,

Dudhedia

et al. 2024

MMEP

View full text Add to dashboard Cite

show abstract

“…While certain classes of gate interactions, such as crossresonance, rely on linear coupling modes between superconducting qubits [31], [32], there is increasingly widespread use of parametric or tunable couplers among of groups of two or more qubits, which can be transmons, flux qubits, or high-Q cavities [14], [15], [20], [33], [34]. In these systems, the coupler's nonlinearity is driven with external flux and/or microwave fields to create a wide array of potential gates.…”

Section: A Flexible Realization Of Gates With Parametric Couplingsmentioning

confidence: 99%

“…Fig.1: Cartan Trajectories[20] for CNOT (blue) and SWAP (red) using √ iSWAP basis. The trajectories represent the total accumulated unitary transformation over time, beginning at Identity I and ending at the target gate U T .…”

mentioning

confidence: 99%

Parallel Driving for Fast Quantum Computing Under Speed Limits

McKinney¹,

Zhou²,

Xia³

et al. 2023

Preprint

View full text Add to dashboard Cite

Increasing quantum circuit fidelity requires an efficient instruction set to avoid errors from decoherence. The choice of a two-qubit (2Q) hardware basis gate depends on a quantum modulator's native Hamiltonian interactions and applied control drives. In this paper, we propose a collaborative design approach to select the best ratio of drive parameters that determine the best basis gate for a particular modulator. This requires considering the theoretical computing power of the gate along with the practical speed limit of that gate, given the modulator drive parameters. The practical speed limit arises from the couplers' tolerance for strong driving when one or more pumps is applied, for which some combinations can result in higher overall speed limits than others. Moreover, as this 2Q basis gate is typically applied multiple times in succession, interleaved by 1Q gates applied directly to the qubits, the speed of the 1Q gates can become a limiting factor for the quantum circuit. We propose a parallel-drive approach that drives the modulator and qubits simultaneously, allowing a richer capability of the 2Q basis gate and in some cases for this 1Q drive time to be absorbed entirely into the 2Q operation. This allows increasingly short duration 2Q gates while mitigating a significant source of overhead in some quantum systems. On average, this approach can decrease circuit duration by 17.84% and decrease infidelity for random 2Q gates by 10.5% compared to the best basic 2Q gate, √ iSWAP.

show abstract