Embedded Complexity and Quantum Circuit Volume

• URL: http://arxiv.org/abs/2408.16602v1
• Date: Thu, 29 Aug 2024 15:12:33 GMT
• Title: Embedded Complexity and Quantum Circuit Volume
• Authors: Zhenyu Du, Zi-Wen Liu, Xiongfeng Ma,
• Abstract summary: We introduce the notion of embedded complexity, which accounts for both system extensions and measurements. We study the complexity of projected states in a subsystem after measuring its complement. We demonstrate a spacetime conversion that concentrates circuit volume onto a subsystem via a random gate teleportation approach.
• Score: 0.9012198585960441
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum circuit complexity is a pivotal concept in quantum information, quantum many-body physics, and high-energy physics. While extensively studied for closed systems, the characterization and dynamics of circuit complexity are little understood for the situation where the system is embedded within a larger system, which encompasses measurement-assisted state preparation. To address this gap, we introduce the notion of embedded complexity, which accounts for both system extensions and measurements. We study the complexity of projected states in a subsystem after measuring its complement and find that in random circuits, the embedded complexity is lower-bounded by the circuit volume -- the total number of gates affecting both the subsystem and its complement. This finding indicates that the total cost of preparing the projected state cannot be reduced by leveraging ancillary qubits and measurements in general. Our result underscores the operational meaning of circuit volume, as it characterizes the embedded complexity of the generated state. Specifically, for random circuits or Clifford circuits, we demonstrate a spacetime conversion that concentrates circuit volume onto a subsystem via a random gate teleportation approach. In scenarios of deep thermalization where the system interacts extensively with a larger system, our analysis suggests that the resulting projected states exhibit high complexity. Additionally, we introduce a shadow tomography protocol that employs only ancillary random states and Bell state measurements, circumventing the need to evolve the input state and thereby simplifying experimental controls.

Related papers

• Efficient Quantum Circuits based on the Quantum Natural Gradient [0.0]
  Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. We propose symmetry-conserving modified quantum approximate optimization algorithm(SCom-QAOA) circuits. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of non-equilibrium phenomena in quantum simulators.
  arXiv  Detail & Related papers  (2023-10-16T16:08:57Z)
• Complexity for one-dimensional discrete time quantum walk circuits [0.0]
  We compute the complexity for the mixed state density operator derived from a one-dimensional discrete-time quantum walk (DTQW) The complexity is computed using a two-qubit quantum circuit obtained from canonically purifying the mixed state.
  arXiv  Detail & Related papers  (2023-07-25T12:25:03Z)
• Quantum complexity phase transitions in monitored random circuits [0.29998889086656577]
  We study the dynamics of the quantum state complexity in monitored random circuits. We find that the evolution of the exact quantum state complexity undergoes a phase transition when changing the measurement rate.
  arXiv  Detail & Related papers  (2023-05-24T18:00:11Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Circuit Complexity through phase transitions: consequences in quantum state preparation [0.0]
  We analyze the circuit complexity for preparing ground states of quantum many-body systems. In particular, how this complexity grows as the ground state approaches a quantum phase transition.
  arXiv  Detail & Related papers  (2023-01-11T19:00:10Z)
• Analysis of arbitrary superconducting quantum circuits accompanied by a Python package: SQcircuit [0.0]
  Superconducting quantum circuits are a promising hardware platform for realizing a fault-tolerant quantum computer. We develop a framework to construct a superconducting quantum circuit's quantized Hamiltonian from its physical description. We implement the methods described in this work in an open-source Python package SQcircuit.
  arXiv  Detail & Related papers  (2022-06-16T17:24:51Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)
• 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.