155 citations · 451 across the 11 of their papers we have counts for
11 papers
Fast pseudorandom quantum state generators via inflationary quantum gates
Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein +1
We propose a mechanism for reaching pseudorandom quantum states, computationally indistinguishable from Haar random, with shallow log-n depth quantum circuits, where n is the numbe…
Z2 topological order and first-order quantum phase transitions in systems with combinatorial gauge symmetry
Kai-Hsin Wu, Zhi-Cheng Yang, Dmitry Green +2
We study a generalization of the two-dimensional transverse-field Ising model, combining both ferromagnetic and antiferromagnetic two-body interactions, that hosts exact global and…
quantum double in a superconducting wire array
Zhi-Cheng Yang, Dmitry Green, Hongji Yu +1
We show that a quantum double can be realized in an array of superconducting wires coupled via Josephson junctions. With a suitably chosen magnetic flux threading th…
Constructing Quantum Spin Liquids Using Combinatorial Gauge Symmetry
Claudio Chamon, Dmitry Green, Zhi-Cheng Yang
We introduce the notion of combinatorial gauge symmetry -- a local transformation that includes single spin rotations plus permutations of spins (or swaps of their quantum states)…
Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
Shiyu Zhou, Zhi-Cheng Yang, Alioscia Hamma +1
Clifford circuits are insufficient for universal quantum computation or creating -designs with . While the entanglement entropy is not a telltale of this insufficiency,…
Scrambling via Braiding of Nonabelions
Zhi-Cheng Yang, Konstantinos Meichanetzidis, Stefanos Kourtis +1
We study how quantum states are scrambled via braiding in systems of non-Abelian anyons through the lens of entanglement spectrum statistics. In particular, we focus on the degree…
Tensor network method for reversible classical computation
Zhi-Cheng Yang, Stefanos Kourtis, Claudio Chamon +2
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (…
Entanglement Complexity in Quantum Many-Body Dynamics, Thermalization and Localization
Zhi-Cheng Yang, Alioscia Hamma, Salvatore M. Giampaolo +2
Entanglement is usually quantified by von Neumann entropy, but its properties are much more complex than what can be expressed with a single number. We show that the three distinct…
Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani +2
We use Pontryagin's minimum principle to optimize variational quantum algorithms. We show that for a fixed computation time, the optimal evolution has a bang-bang (square pulse) fo…
Quantum Vertex Model for Reversible Classical Computing
C. Chamon, E. R. Mucciolo, A. E. Ruckenstein +1
Mappings of classical computation onto statistical mechanics models have led to remarkable successes in addressing some complex computational problems. However, such mappings displ…
Two-component Structure in the Entanglement Spectrum of Highly Excited States
Zhi-Cheng Yang, Claudio Chamon, Alioscia Hamma +1
We study the entanglement spectrum of highly excited eigenstates of two known models that exhibit a many-body localization transition, namely the one-dimensional random-field Heise…