Aspects of The First Law of Complexity

• URL: http://arxiv.org/abs/2002.05779v2
• Date: Fri, 29 May 2020 16:30:18 GMT
• Title: Aspects of The First Law of Complexity
• Authors: Alice Bernamonti, Federico Galli, Juan Hernandez, Robert C. Myers, Shan-Ming Ruan, Joan Sim\'on
• Abstract summary: We investigate the first law of complexity proposed in arXiv:1903.04511, i.e., the variation of complexity when the target state is perturbed. Based on Nielsen's geometric approach to quantum circuit complexity, we find the variation only depends on the end of the optimal circuit.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the first law of complexity proposed in arXiv:1903.04511, i.e., the variation of complexity when the target state is perturbed, in more detail. Based on Nielsen's geometric approach to quantum circuit complexity, we find the variation only depends on the end of the optimal circuit. We apply the first law to gain new insights into the quantum circuits and complexity models underlying holographic complexity. In particular, we examine the variation of the holographic complexity for both the complexity=action and complexity=volume conjectures in perturbing the AdS vacuum with coherent state excitations of a free scalar field. We also examine the variations of circuit complexity produced by the same excitations for the free scalar field theory in a fixed AdS background. In this case, our work extends the existing treatment of Gaussian coherent states to properly include the time dependence of the complexity variation. We comment on the similarities and differences of the holographic and QFT results.

Related papers

• Spread complexity in saddle-dominated scrambling [0.0]
  We study the spread complexity of the thermofield double state within emphintegrable systems that exhibit saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of emphchaotic systems.
  arXiv  Detail & Related papers  (2023-12-19T20:41:14Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• 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)
• Cosmological complexity of the modified dispersion relation [3.0346001106791323]
  The curvature perturbation of the scalar field is identified with the two-mode squeezed state. Our numeric indicates that the complexity of the modified dispersion relation will have a non-linear pattern after the horizon exits. Since the modified dispersion relation can be dubbed as the consequences of various frameworks of quantum gravity, it could be applicable to these frameworks.
  arXiv  Detail & Related papers  (2023-09-04T13:26:20Z)
• 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)
• One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
  We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound. This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
  arXiv  Detail & Related papers  (2023-01-05T11:05:22Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• 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)
• Quantum Circuit Complexity of Primordial Perturbations [0.0]
  We study the quantum circuit complexity of cosmological perturbations in different models of the early universe. Our analysis serves to highlight how different models achieve the same end result for the perturbations via different routes.
  arXiv  Detail & Related papers  (2020-12-09T08:30:07Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

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.