Crystalline Quantum Circuits

• URL: http://arxiv.org/abs/2210.10808v3
• Date: Tue, 1 Aug 2023 01:04:01 GMT
• Title: Crystalline Quantum Circuits
• Authors: Grace M. Sommers, David A. Huse, Michael J. Gullans
• Abstract summary: Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics. Motivated by an interest in deterministic circuits with similar applications, we construct classes of textitnonrandom unitary Clifford circuits. A full classification on the square lattice reveals, of particular interest, a "nonfractal good scrambling class" with dense operator spreading.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics, while remaining analytically tractable through probabilistic methods. Motivated by an interest in deterministic circuits with similar applications, we construct classes of \textit{nonrandom} unitary Clifford circuits by imposing translation invariance in both time and space. Further imposing dual-unitarity, our circuits effectively become crystalline spacetime lattices whose vertices are SWAP or iSWAP two-qubit gates and whose edges may contain one-qubit gates. One can then require invariance under (subgroups of) the crystal's point group. Working on the square and kagome lattices, we use the formalism of Clifford quantum cellular automata to describe operator spreading, entanglement generation, and recurrence times of these circuits. A full classification on the square lattice reveals, of particular interest, a "nonfractal good scrambling class" with dense operator spreading that generates codes with linear contiguous code distance and high performance under erasure errors at the end of the circuit. We also break unitarity by adding spacetime-translation-invariant measurements and find a class of such circuits with fractal dynamics.

Related papers

• Free Independence and the Noncrossing Partition Lattice in Dual-Unitary Quantum Circuits [0.0]
  We investigate details of the chaotic dynamics of dual-unitary quantum circuits. By writing the correlators as contractions of a class of quantum channels, we prove their exponential decay. We also develop a replica trick for dual-unitary circuits, which may be useful and of interest in its own right.
  arXiv  Detail & Related papers  (2024-09-25T18:00:00Z)
• Quantum advantage from measurement-induced entanglement in random shallow circuits [0.18749305679160366]
  We show that long-range measurement-induced entanglement (MIE) proliferates when the circuit depth is at least a constant critical value. We introduce a two-dimensional, depth-2, "coarse-grained" circuit architecture, composed of random Clifford gates acting on O(log n) qubits.
  arXiv  Detail & Related papers  (2024-07-30T21:39:23Z)
• Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
  Current quantum computing hardware is restricted by the availability of only few, noisy qubits. We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
  arXiv  Detail & Related papers  (2023-03-02T13:05:19Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Circuit connectivity boosts by quantum-classical-quantum interfaces [0.4194295877935867]
  High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits.
  arXiv  Detail & Related papers  (2022-03-09T19:00:02Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Spacetime as a quantum circuit [0.0]
  We find that surfaces of constant scalar curvature play a special role in optimizing quantum circuits. We also find an interesting connection of our proposal to kinematic space, and discuss possible circuit representations and gate counting interpretations of the gravitational action.
  arXiv  Detail & Related papers  (2021-01-04T19:00:02Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.