Pith. sign in

REVIEW 1 cited by

QuCLEAR: Clifford Extraction and Absorption for Quantum Circuit Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.13316 v2 pith:UDBCE64I submitted 2024-08-23 quant-ph cs.ET

classification quant-phcs.ET
keywords quantumcliffordcircuitcircuitsoptimizationquclearabsorptionclassically
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum computing carries significant potential for addressing practical problems. However, currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits. Therefore, quantum circuit optimization is crucial for obtaining useful results. In this paper, we present QuCLEAR, a compilation framework designed to optimize quantum circuits. QuCLEAR significantly reduces both the two-qubit gate count and the circuit depth through two novel optimization steps. First, we introduce the concept of Clifford Extraction, which extracts Clifford subcircuits to the end of the circuit while optimizing the gates. Second, since Clifford circuits are classically simulatable, we propose Clifford Absorption, which efficiently processes the extracted Clifford subcircuits classically. We demonstrate our framework on quantum simulation circuits, which have wide-ranging applications in quantum chemistry simulation, many-body physics, and combinatorial optimization problems. Near-term algorithms such as VQE and QAOA also fall within this category. Experimental results across various benchmarks show that QuCLEAR achieves up to a $77.7\%$ reduction in CNOT gate count and up to an $84.1\%$ reduction in entangling depth compared to state-of-the-art methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A generic multi-Pauli compilation framework for limited connectivity

    quant-ph 2024-12 conditional novelty 7.0 of 10

    A Clifford-tableau-like representation enables simultaneous implementation of multiple non-commuting Pauli exponentials, reducing CNOT counts for VQE circuits on limited-connectivity hardware.

Pith tools