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

• URL: http://arxiv.org/abs/2210.16195v1
• Date: Fri, 28 Oct 2022 15:04:55 GMT
• Title: CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate
• Authors: Dmitri Maslov and Willers Yang
• Abstract summary: A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. 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.
• Score: 5.672898304129217
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 implies the ability to implement arbitrary Clifford transformation over LNN in depth no more than $7n{+}2$, 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 constant 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.

Related papers

• Minimum Synthesis Cost of CNOT Circuits [0.0]
  We use a novel method of categorizing CNOT gates in a synthesis to obtain a strict lower bound computable in $O(nomega)$ time. Applying our framework, we prove that $3(n-1)$ gate syntheses of the $n$-cycle circuit are optimal and provide insight into their structure.
  arXiv  Detail & Related papers  (2024-08-15T03:09:53Z)
• Minimal Clifford Shadow Estimation by Mutually Unbiased Bases [5.002981581926959]
  We introduce the minimal Clifford measurement (MCM) to reduce the number of possible random circuits to the minimum. Compared to the original Clifford measurements, our MCM significantly reduces the circuit complexity and the compilation costs.
  arXiv  Detail & Related papers  (2023-10-28T16:22:04Z)
• Optimising quantum circuits is generally hard [0.0]
  We find that many gate optimisation problems for approximately universal quantum circuits are NP-hard. We show that for any non-Clifford gate $G$ it is NP-hard to optimise the $G$-count over the Clifford+$G$ gate set.
  arXiv  Detail & Related papers  (2023-09-12T09:35:23Z)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences [4.423586186569902]
  We propose an algorithm for synthesizing a sequence of $pi/4$ Pauli rotations with a minimal number of Hadamard gates. We present an algorithm which optimally minimizes the number of Hadamard gates lying between the first and the last $T$ gate of the circuit.
  arXiv  Detail & Related papers  (2023-02-14T13:44:11Z)
• Pseudonorm Approachability and Applications to Regret Minimization [73.54127663296906]
  We convert high-dimensional $ell_infty$-approachability problems to low-dimensional pseudonorm approachability problems. We develop an algorithmic theory of pseudonorm approachability, analogous to previous work on approachability for $ell$ and other norms.
  arXiv  Detail & Related papers  (2023-02-03T03:19:14Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Toward Trainability of Deep Quantum Neural Networks [87.04438831673063]
  Quantum Neural Networks (QNNs) with random structures have poor trainability due to the exponentially vanishing gradient as the circuit depth and the qubit number increase. We provide the first viable solution to the vanishing gradient problem for deep QNNs with theoretical guarantees.
  arXiv  Detail & Related papers  (2021-12-30T10:27:08Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Beyond Lazy Training for Over-parameterized Tensor Decomposition [69.4699995828506]
  We show that gradient descent on over-parametrized objective could go beyond the lazy training regime and utilize certain low-rank structure in the data. Our results show that gradient descent on over-parametrized objective could go beyond the lazy training regime and utilize certain low-rank structure in the data.
  arXiv  Detail & Related papers  (2020-10-22T00:32:12Z)
• Hadamard-free circuits expose the structure of the Clifford group [9.480212602202517]
  The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. We show that any Clifford operator can be uniquely written in the canonical form $F_HSF$. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group.
  arXiv  Detail & Related papers  (2020-03-20T17:51:36Z)

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.