Transport and entanglement growth in long-range random Clifford circuits

Richter, Jonas; Lunt, Oliver; Pal, Arijeet

doi:10.48550/arxiv.2205.06309

Cited by 2 publications

(2 citation statements)

References 95 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After each such optimization step, the parameters in the cluster circuit U j (θ) are adjusted. For the case of Clifford circuits, one may consider techniques proposed in refs 58,59 to further optimize the depth of the resulting circuits.…”

Section: General Gatesmentioning

confidence: 99%

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Schleich

Boen

Cincio

et al. 2023

J. Chem. Theory Comput.

View full text Add to dashboard Cite

Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near term. In this work, we investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits and the variational quantum eigensolver. To this end, we consider naive and physically motivated, classically efficient product ansatz for the parametrized wavefunction adapting the separable-pair ansatz form. We combine it with post-treatment to account for interactions between subsystems originating from this ansatz. The classical treatment is given by another quantum circuit that has support between the enforced subsystems and is folded into the Hamiltonian. To avoid an exponential increase in the number of Hamiltonian terms, the entangling operations are constructed from purely Clifford or near-Clifford circuits. While Clifford circuits can be simulated efficiently classically, they are not universal. In order to account for missing expressibility, near-Clifford circuits with only few, selected non-Clifford gates are employed. The exact circuit structure to achieve this objective is molecule-dependent and is constructed using simulated annealing and genetic algorithms. We demonstrate our approach on a set of molecules of interest and investigate the extent of our methodology’s reach.

show abstract

Section: General Gatesmentioning

confidence: 99%

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Schleich

Boen

Cincio

et al. 2023

J. Chem. Theory Comput.

View full text Add to dashboard Cite

show abstract

“…There are a variety of ways to change the type of physics being simulated. One can change the rule (even making them random [54]), the local Hilbert space, or the structure of the lattice (cf. [35,36]), thereby implementing alternate types of many-body systems.…”

mentioning

confidence: 99%

Scrambling in quantum cellular automata

Kent¹,

Racz²,

Shashi³

2023

Preprint

View full text Add to dashboard Cite

Scrambling is the delocalization of quantum information over a many-body system and underlies all quantum-chaotic dynamics. We employ discrete quantum cellular automata as classically simulable toy models of scrambling. We observe that these automata break ergodicity, i.e. they exhibit quantum scarring. We also find that the time-scale of scrambling rises with the local Hilbert-space dimension and obeys a specific combinatorial pattern. We then show that scarring is mostly suppressed in a semiclassical limit, demonstrating that semiclassical-chaotic systems are more ergodic.

show abstract

Transport and entanglement growth in long-range random Clifford circuits

Cited by 2 publications

References 95 publications

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Scrambling in quantum cellular automata

Contact Info

Product

Resources

About