Eisert, Jens
Helmholtz-Zentrum Berlin für Materialien und Energie · Freie Universität Berlin
24 papers on CoChatORCID 0000-0003-3033-1292
Most cited papers
- Verified
Colloquium : Area laws for the entanglement entropy
Eisert, J., Cramer, M., & Plenio, M. B. (2010) · Reviews of Modern Physics
Quantum many-body systemsQuantum Information and Cryptography
Cited by 2,873
- Verified
Quantum many-body systems out of equilibrium
Eisert, J., Friesdorf, M., & Gogolin, C. (2015) · Nature Physics
Quantum many-body systemsAdvanced Thermodynamics and Statistical Mechanics
Cited by 1,255
- Verified
Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional Bose gas
Trotzky, S., Chen, Y.-A., Flesch, A., McCulloch, I. P., Schollwöck, U., Eisert, J., & Bloch, I. (2012) · Nature Physics
Cold Atom Physics and Bose-Einstein CondensatesQuantum many-body systems
Cited by 1,058
- Verified
Assessing Non-Markovian Quantum Dynamics
Wolf, M. M., Eisert, J., Cubitt, T. S., & Cirac, J. I. (2008) · Physical Review Letters
Quantum Information and CryptographyQuantum Mechanics and Applications
Cited by 596
- Verified
Evenly distributed unitaries: On the structure of unitary designs
Gross, D., Audenaert, K., & Eisert, J. (2007) · Journal of Mathematical Physics
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 358
- Verified
Novel Schemes for Measurement-Based Quantum Computation
Gross, D., & Eisert, J. (2007) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 255
- Verified
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 236
- Verified
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Quantum
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 219
- Verified
General Entanglement Scaling Laws from Time Evolution
Eisert, J., & Osborne, T. J. (2006) · Physical Review Letters
Quantum many-body systemsQuantum Information and Cryptography
Cited by 201
- Verified
Driving non-Gaussian to Gaussian states with linear optics
Browne, D. E., Eisert, J., Scheel, S., & Plenio, M. B. (2003) · Physical Review A
Quantum Information and CryptographyQuantum Computing Algorithms and Architecture
Cited by 191
- Verified
Thermalization in Nature and on a Quantum Computer
Riera, A., Gogolin, C., & Eisert, J. (2012) · Physical Review Letters
Quantum many-body systemsQuantum Computing Algorithms and Architecture
Cited by 189
- Verified
Dissipative Quantum Church-Turing Theorem
Kliesch, M., Barthel, T., Gogolin, C., Kastoryano, M., & Eisert, J. (2011) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 154
- Verified
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 145
- Verified
Contraction of fermionic operator circuits and the simulation of strongly correlated fermions
Barthel, T., Pineda, C., & Eisert, J. (2009) · Physical Review A
Quantum many-body systemsQuantum Computing Algorithms and Architecture
Cited by 139
- Verified
Percolation, Renormalization, and Quantum Computing with Nondeterministic Gates
Kieling, K., Rudolph, T., & Eisert, J. (2007) · Physical Review Letters
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 121
- Verified
Quantum computational advantage via high-dimensional Gaussian boson sampling
Deshpande, A., Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., et al. (2022) · Science Advances
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 106
- Verified
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 58
- Verified
Area laws and efficient descriptions of quantum many-body states
Ge, Y., & Eisert, J. (2016) · New Journal of Physics
Quantum many-body systemsQuantum Computing Algorithms and Architecture
Cited by 53
- Verified
Extracting Dynamical Equations from Experimental Data is NP Hard
Cubitt, T. S., Eisert, J., & Wolf, M. M. (2012) · Physical Review Letters
Computability, Logic, AI AlgorithmsQuantum Computing Algorithms and Architecture
Cited by 52
- Verified
The Complexity of Relating Quantum Channels to Master Equations
Cubitt, T. S., Eisert, J., & Wolf, M. M. (2012) · Communications in Mathematical Physics
Quantum Information and CryptographyQuantum Mechanics and Applications
Cited by 44
- Verified · note
Localized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 37
- Verified
Cluster state preparation using gates operating at arbitrary success probabilities
Kieling, K., Gross, D., & Eisert, J. (2007) · New Journal of Physics
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 21
- Verified
Decoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 13
- Verified
Gottesman-Kitaev-Preskill codes: A lattice perspective
Conrad, J., Eisert, J., & Arzani, F. (2022) · Quantum
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 0
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free