CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate Article Swipe

MAKE IMPACT

Dmitri Maslov , Willers Yang · YOU? · · 2022 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2210.16195

A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation, -P-CZ-CNOT-, where each stage consists only of gates of the specified type. In this paper, we focus on the minimization of circuit depth by entangling gates, corresponding to the important time-to-solution metric and the reduction of noise due to decoherence. We consider two popular connectivity maps: Linear Nearest Neighbor (LNN) and all-to-all. First, we show that a Hadamard-free Clifford operation can be implemented over LNN in depth $5n$, i.e., in the same depth as the -CNOT- stage alone. This allows us to implement arbitrary Clifford transformation over LNN in depth no more than $7n{-}4$, improving the best previous upper bound of $9n$. Second, we report heuristic evidence that on average a random uniformly distributed Hadamard-free Clifford transformation over $n{>}6$ qubits can be implemented with only a tiny additive overhead over all-to-all connected architecture compared to the best-known depth-optimized implementation of the -CNOT- stage alone. This suggests the reduction of the depth of Clifford circuits from $2n\,{+}\,O(\log^2(n))$ to $1.5n\,{+}\,O(\log^2(n))$ over unrestricted architectures.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/2210.16195

PDF

https://arxiv.org/pdf/2210.16195

OA Status

green

References

19

Related Works

10

OpenAlex ID

https://openalex.org/W4307786564

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W4307786564

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.2210.16195

Digital Object Identifier

Title

CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2022

Year of publication

Publication date

2022-10-28

Full publication date if available

Authors

Dmitri Maslov, Willers Yang

List of authors in order

Landing page

https://arxiv.org/abs/2210.16195

Publisher landing page

PDF URL

https://arxiv.org/pdf/2210.16195

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/2210.16195

Direct OA link when available

Concepts

Controlled NOT gate, Hadamard transform, Quantum computer, Toffoli gate, Quantum gate, Quantum circuit, Metric (unit), Transformation (genetics), Overhead (engineering), Computer science, Mathematics, Electronic circuit, Topology (electrical circuits), Discrete mathematics, Algorithm, Quantum, Quantum error correction, Combinatorics, Physics, Quantum mechanics, Operations management, Gene, Chemistry, Biochemistry, Operating system, Mathematical analysis, Economics

Top concepts (fields/topics) attached by OpenAlex

Cited by

0

Total citation count in OpenAlex

References (count)

19

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload