Presentation
Retract: Logarithmic-Depth Reconstruction of Continuous Controlled-NOT Logic Block
DescriptionNear-term quantum computers have the challenge of the short coherence time, which significantly limits the depth of verifiable quantum programs; thus, it is essential to implement a depth-efficient quantum algorithm.
We note that the linear-depth CNOT block observed in such as Bernstein-Vazirani (BV) algorithm and error detection codes are a major bottleneck in the quantum circuit execution process, which stems from an unparallelizable structure in which the target of CNOTs is concentrated in a single qubit.
In this task, we propose \textit{Retract} (contRollEd gaTe RearrAngement for reduCing depTh), which redesigns these CNOT structures into tree structures that expand logarithmically as the number of qubits increases.
Our experiments confirm the benefits of circuit depth reduction and fidelity improvement of \textit{Retract} over the conventional linear-depth CNOT implementation by conducting the tensor network-based simulation and IBM quantum machine evaluations.
We note that the linear-depth CNOT block observed in such as Bernstein-Vazirani (BV) algorithm and error detection codes are a major bottleneck in the quantum circuit execution process, which stems from an unparallelizable structure in which the target of CNOTs is concentrated in a single qubit.
In this task, we propose \textit{Retract} (contRollEd gaTe RearrAngement for reduCing depTh), which redesigns these CNOT structures into tree structures that expand logarithmically as the number of qubits increases.
Our experiments confirm the benefits of circuit depth reduction and fidelity improvement of \textit{Retract} over the conventional linear-depth CNOT implementation by conducting the tensor network-based simulation and IBM quantum machine evaluations.
Event Type
Work-in-Progress Poster
TimeWednesday, June 265:00pm - 6:00pm PDT
LocationLevel 2 Lobby
AI
Autonomous Systems
Cloud
Design
EDA
Embedded Systems
IP
Security