Quantum State Complexity in Computationally Tractable Quantum Circuits
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...
Main Author: | Jason Iaconis |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2021-02-01
|
Series: | PRX Quantum |
Online Access: | http://doi.org/10.1103/PRXQuantum.2.010329 |
Similar Items
-
Quantum state preparation of normal distributions using matrix product states
by: Jason Iaconis, et al.
Published: (2024-01-01) -
Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis
by: Bao Gia Bach, et al.
Published: (2023-05-01) -
Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers
by: Alessandro Carbone, et al.
Published: (2022-03-01) -
Realising and compressing quantum circuits with quantum reservoir computing
by: Ghosh, Sanjib, et al.
Published: (2021) -
Simulating Large Quantum Circuits on a Small Quantum Computer
by: Peng, Tianyi, et al.
Published: (2021)