Alexey V. Gorshkov

University of Maryland, College Park

OpticsQuantum entanglementPhysicsStatistical physicsElectromagnetically induced transparencyPhotonQuantum simulatorQuantum informationHamiltonian (quantum mechanics)Bound stateAtomic physicsMaterials scienceQubitCondensed matter physicsIsing modelQuantum computerQuantum mechanicsRydberg formulaQuantumOptical latticeDissipative system

345Publications

55H-index

8,147Citations

Publications 320

Newest

#1Przemyslaw BieniasH-Index: 14

#2Sarthak Subhankar (UMD: University of Maryland, College Park)H-Index: 6

Last. Alexey V. GorshkovH-Index: 55

view all 11 authors...

There has been a recent surge of interest and progress in creating subwavelength free-space optical potentials for ultra-cold atoms. A key open question is whether geometric potentials, which are repulsive and ubiquitous in the creation of subwavelength free-space potentials, forbid the creation of narrow traps with long lifetimes. Here, we show that it is possible to create such traps. We propose two schemes for realizing subwavelength traps and demonstrate their superiority over existing propo...

#1Andrew Y. GuoH-Index: 6

#2Abhinav DeshpandeH-Index: 7

Last. Alexey V. GorshkovH-Index: 55

view all 9 authors...

The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as 1/r^\alphain the distance rprovide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrar...

Due to their strong and tunable interactions, Rydberg atoms can be used to realize fast two-qubit entangling gates. We propose a generalization of a generic two-qubit Rydberg-blockade gate to multi-qubit Rydberg-blockade gates which involve both many control qubits and many target qubits simultaneously. This is achieved by using strong microwave fields to dress nearby Rydberg states, leading to asymmetric blockade in which control-target interactions are much stronger than control-control and ta...

#1Minh C. Tran (UMD: University of Maryland, College Park)H-Index: 12

#2Su-Kuan Chu (UMD: University of Maryland, College Park)H-Index: 4

Last. Alexey V. Gorshkov (UMD: University of Maryland, College Park)H-Index: 55

view all 5 authors...

Quantum computers can efficiently simulate the dynamics of quantum systems. In this paper, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n..

#1P. BeckerH-Index: 9

#2W. L. TanH-Index: 8

Last. Christopher MonroeH-Index: 86

view all 14 authors...

#1Zhi-Cheng Yang (UMD: University of Maryland, College Park)H-Index: 10

#2Fangli Liu (UMD: University of Maryland, College Park)H-Index: 11

Last. Thomas Iadecola (Iowa State University)H-Index: 16

view all 4 authors...

We study one-dimensional spin-1/2 models in which strict confinement of Ising domain walls leads to the fragmentation of Hilbert space into exponentially many disconnected subspaces. Whereas most previous works emphasize dipole moment conservation as an essential ingredient for such fragmentation, we instead require two commuting U(1) conserved quantities associated with the total domain-wall number and the total magnetization. The latter arises naturally from the confinement of domain walls. Re...

#1Oles ShtankoH-Index: 7

#2Abhinav DeshpandeH-Index: 7

Last. Alexey V. GorshkovH-Index: 55

view all 4 authors...

Free-fermionic systems are a valuable, but limited, class of many-body problems efficiently simulable on a classical computer. We examine how classical simulability of noninteracting fermions is modified in the presence of Markovian dissipation described by quadratic Lindblad operators, including, for example, incoherent transitions or pair losses. On the one hand, we establish three broad classes of Markovian dynamics that are efficiently simulable classically, by devising efficient algorithms....

#1Oles ShtankoH-Index: 7

#2Yaroslav A. KharkovH-Index: 6

Last. Alexey V. GorshkovH-Index: 55

view all 4 authors...

The evolution of entanglement entropy in quantum circuits composed of Haar-random gates and projective measurements shows versatile behavior, with connections to phase transitions and complexity theory. We reformulate the problem in terms of a classical Markov process for the dynamics of bipartition purities and establish a probabilistic cellular-automaton algorithm to compute entanglement entropy in monitored random circuits on arbitrary graphs. In one dimension, we further relate the evolution...

#1Fangli Liu (UMD: University of Maryland, College Park)H-Index: 11

#2Seth Whitsitt (UMD: University of Maryland, College Park)H-Index: 9

Last. Alexey V. Gorshkov (UMD: University of Maryland, College Park)H-Index: 55

view all 8 authors...

The authors study the circuit complexity of quantum states in the one-dimensional topological model. They find that the circuit complexities of both ground states and non-equilibrium steady states exhibit non-analyticity at the critical points, signaling the presence of topological phase transitions. The results establish a connection between circuit complexity and quantum phase transitions, and open a new avenue to using circuit complexity to understand quantum many-body systems.

Close Researchers

Mikhail D. Lukin

H-index : 158

Thibault Peyronel

H-index : 7

Michael Foss-Feig

H-index : 30

Vladan Vuletic

H-index : 67

Zhe-Xuan Gong

H-index : 22

Ana Maria Rey

H-index : 62

Przemyslaw Bienias

H-index : 14

Eugene Demler

H-index : 102

This website uses cookies.

We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.

To learn more, you can find in our Privacy Policy.

To learn more, you can find in our Privacy Policy.