Absence of censoring inequalities in random quantum circuits

• URL: http://arxiv.org/abs/2502.15995v1
• Date: Fri, 21 Feb 2025 23:17:26 GMT
• Title: Absence of censoring inequalities in random quantum circuits
• Authors: Daniel Belkin, James Allen, Bryan K. Clark,
• Abstract summary: We construct a family of architectures such that the approximate $2$-design depth decreases when certain gates are deleted.<n>We also give some intuition for this construction and discuss the relevance of this result to the approximate $t$-design depth of the 1D brickwork.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ref. 1 asked whether deleting gates from a random quantum circuit architecture can ever make the architecture a better approximate $t$-design. We show that it can. In particular, we construct a family of architectures such that the approximate $2$-design depth decreases when certain gates are deleted. We also give some intuition for this construction and discuss the relevance of this result to the approximate $t$-design depth of the 1D brickwork. Deleting gates always decreases scrambledness in the short run, but can sometimes cause it to increase in the long run. Finally, we give analogous results for spectral gaps and when deleting edges of interaction graphs.

Related papers

• Bridging wire and gate cutting with ZX-calculus [45.200826131319815]
  We show how decompositions of ideal, global unitaries can be obtained diagrammatically using ZX-calculus expanding. We obtain improved decompositions for multi-qubit controlled-Z (MCZ) gates with $1$-norm equal to $3$ for any number of qubits and any partition.
  arXiv  Detail & Related papers  (2025-03-14T15:20:47Z)
• Ancilla-free Quantum Adder with Sublinear Depth [2.784223169208082]
  We present the first exact quantum adder with sublinear depth and no ancilla qubits. Our construction is based on classical reversible logic only.
  arXiv  Detail & Related papers  (2025-01-28T09:05:49Z)
• Faster Mixing of Higher-Dimensional Random Reversible Circuits [0.10241134756773229]
  Our main result is the first construction of a natural class of random reversible circuits with a sublinear-in-$n$ dependence on depth.<n>Our construction is motivated by considerations in practical cryptography and is somewhat inspired by the design of practical block ciphers, such as DES and AES.<n>The main novelty of our circuit model is a gate architecture built on higher-dimensional lattices.
  arXiv  Detail & Related papers  (2024-09-22T22:28:14Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• A T-depth two Toffoli gate for 2D square lattice architectures [49.88310438099143]
  We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures.
  arXiv  Detail & Related papers  (2023-11-21T10:33:51Z)
• Approximate t-designs in generic circuit architectures [0.0]
  Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain random quantum circuit ensembles approximate t-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates.
  arXiv  Detail & Related papers  (2023-10-30T17:49:44Z)
• 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)
• 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)
• Reassessing the computational advantage of quantum-controlled ordering of gates [0.0]
  In quantum computation, indefinite causal structures decide whether two unitary gates commute or anticommute with a single call to each gate. In this work, we show that this advantage is smaller than expected. We present a causal algorithm that solves the only known specific FPP with $O(nlog(n))$ queries and a causal algorithm that solves every FPP with $O(nsqrtn)$ queries.
  arXiv  Detail & Related papers  (2021-02-22T19:00:08Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Scalable quantum computation with fast gates in two-dimensional microtrap arrays of trapped ions [68.8204255655161]
  We investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture. We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighbouring traps faster than the trapping period.
  arXiv  Detail & Related papers  (2020-05-01T13:18:22Z)

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.