Quantum State Complexity in Computationally Tractable Quantum Circuits
- URL: http://arxiv.org/abs/2009.05512v1
- Date: Fri, 11 Sep 2020 16:25:11 GMT
- Title: Quantum State Complexity in Computationally Tractable Quantum Circuits
- Authors: Jason Iaconis
- Abstract summary: We discuss a special class of numerically tractable quantum circuits, known as quantum automaton circuits.
We show that automaton wave functions have high quantum state complexity.
We present evidence of a linear growth of design complexity in local quantum circuits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Characterizing the quantum complexity of local random quantum circuits is a
very deep problem with implications to the seemingly disparate fields of
quantum information theory, quantum many-body physics and high energy physics.
While our theoretical understanding of these systems has progressed in recent
years, numerical approaches for studying these models remains severely limited.
In this paper, we discuss a special class of numerically tractable quantum
circuits, known as quantum automaton circuits, which may be particularly well
suited for this task. These are circuits which preserve the computational
basis, yet can produce highly entangled output wave functions. Using ideas from
quantum complexity theory, especially those concerning unitary designs, we
argue that automaton wave functions have high quantum state complexity. We look
at a wide variety of metrics, including measurements of the output bit-string
distribution and characterization of the generalized entanglement properties of
the quantum state, and find that automaton wave functions closely approximate
the behavior of fully Haar random states. In addition to this, we identify the
generalized out-of-time ordered 2k-point correlation functions as a
particularly useful probe of complexity in automaton circuits. Using these
correlators, we are able to numerically study the growth of complexity well
beyond the scrambling time for very large systems. As a result, we are able to
present evidence of a linear growth of design complexity in local quantum
circuits, consistent with conjectures from quantum information theory.
Related papers
- Taming Quantum Time Complexity [50.10645865330582]
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) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - 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) - Learning marginals suffices! [14.322753787990036]
We investigate the relationship between the sample complexity of learning a quantum state and the circuit complexity of the state.
We show that learning its marginals for the quantum state with low circuit complexity suffices for state tomography.
arXiv Detail & Related papers (2023-03-15T21:09:29Z) - 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) - Quantum simulation using noisy unitary circuits and measurements [0.0]
Noisy quantum circuits have become an important cornerstone of our understanding of quantum many-body dynamics.
We give an overview of two classes of dynamics studied using random-circuit models, with a particular focus on the dynamics of quantum entanglement.
We consider random-circuit sampling experiments and discuss the usefulness of random quantum states for simulating quantum many-body dynamics on NISQ devices.
arXiv Detail & Related papers (2021-12-13T14:00:06Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - 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) - Characterization of quantum states based on creation complexity [0.0]
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state.
We show for an entirely general quantum state it is exponentially hard (requires a number of steps that scales exponentially with the number of qubits) to determine if the creation complexity is.
We then show it is possible for a large class of quantum states with creation complexity to have common coefficient features such that given any candidate quantum state we can design an efficient coefficient sampling procedure to determine if it belongs to the class or not with arbitrarily high success probability.
arXiv Detail & Related papers (2020-04-28T21:12:45Z)
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.