Circuit Complexity in an interacting quenched Quantum Field Theory
- URL: http://arxiv.org/abs/2209.03372v1
- Date: Wed, 7 Sep 2022 18:00:03 GMT
- Title: Circuit Complexity in an interacting quenched Quantum Field Theory
- Authors: Sayantan Choudhury, Rakshit Mandish Gharat, Saptarshi Mandal and
Nilesh Pandey
- Abstract summary: We explore the effects of a quantum quench on the circuit complexity for a quenched quantum field theory having weakly coupled quartic interaction.
We show the analytical computation of circuit complexity for the quenched and interacting field theory.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this work, we explore the effects of a quantum quench on the circuit
complexity for a quenched quantum field theory having weakly coupled quartic
interaction. We use the invariant operator method, under a perturbative
framework, for computing the ground state of this system. We give the
analytical expressions for specific reference and target states using the
ground state of the system. Using a particular cost functional, we show the
analytical computation of circuit complexity for the quenched and interacting
field theory. Further, we give a numerical estimate of circuit complexity with
respect to the quench rate, $\delta t$ for two coupled oscillators. The
parametric variation of the unambiguous contribution of the circuit complexity
for an arbitrary number of oscillators has been studied with respect to the
dimensionless parameter $(t/\delta t$). We comment on the variation of circuit
complexity for different values of coupling strength, different number of
oscillators, and even in different dimensions.
Related papers
- The Complexity of Being Entangled [0.0]
Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations.
For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost.
arXiv Detail & Related papers (2023-11-07T19:00:02Z) - 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) - Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
We numerically simulate and characterize the operation of various quantum processors.
We identify and assess quantum complexity by comparing the performance of each device against benchmark lines.
We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
arXiv Detail & Related papers (2023-04-10T23:01:10Z) - Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation.
We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
arXiv Detail & Related papers (2022-07-07T09:39:40Z) - 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) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Causality Constraint on Circuit Complexity from $COSMOEFT$ [1.5643170704979468]
We study the behaviour of the circuit complexity measures and entanglement entropy with respect to the scale factor and $c_s$.
We find various interesting unexplored features within the window, $0.024leq c_sleq 1$, which is supported by both causality and cosmological observation.
arXiv Detail & Related papers (2021-11-22T19:09:51Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Circuit Complexity From Supersymmetric Quantum Field Theory With Morse
Function [0.0]
We study the relationship between the circuit complexity and Morse theory within the framework of algebraic topology.
We provide technical proof of the well known universal connecting relation between quantum chaos and circuit complexity.
arXiv Detail & Related papers (2021-01-25T19:26:45Z) - 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)
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.