Fetching the paper…
Reading the bibliography…
We initiate a rigorous study of computational entanglement theory, inspired by the emerging usefulness of ideas from quantum information theory in computational complexity.
Average entropy of a subsystem
Don N Page · 1993
Earlier work this paper cites.
Average entropy of a quantum subsystem
Siddhartha Sen · 1996
Earlier work this paper cites.
Microscopic origin of the bekenstein-hawking entropy
Andrew Strominger and Cumrun Vafa · 1996
Earlier work this paper cites.
Private quantum channels
Andris Ambainis, Michele Mosca, Alain Tapp, and Ronald de Wolf · 2000
Earlier work this paper cites.
Limits for entanglement measures
Michał Horodecki, Paweł Horodecki, and Ryszard Horodecki · 2000
Earlier work this paper cites.
The Foundations of Cryptography - Volume 1: Basic Techniques
Oded Goldreich · 2001
Earlier work this paper cites.
Distillation of secret key and entanglement from quantum states
Igor Devetak and Andreas Winter · 2005
Earlier work this paper cites.
Limits on the ability of quantum states to convey classical messages
Ashwin Nayak and Julia Salzman · 2006
Earlier work this paper cites.
Aspects of holographic entanglement entropy
Shinsei Ryu and Tadashi Takayanagi · 2006
Earlier work this paper cites.
Holographic derivation of entanglement entropy from AdS/CFT
Shinsei Ryu and Tadashi Takayanagi · 2006
Earlier work this paper cites.
Toward a general theory of quantum games
Gus Gutoski and John Watrous · 2007
Earlier work this paper cites.
An introduction to entanglement measures
Martin B Plenio and Shashank Virmani · 2007
Earlier work this paper cites.
Single-shot quantum state merging
Mario Berta · 2009
Earlier work this paper cites.
Quantum entanglement
Ryszard Horodecki, Paweł Horodecki, Michał Horodecki, and Karol Horodecki · 2009
Earlier work this paper cites.
Duality between smooth min-and max-entropies
Marco Tomamichel, Roger Colbeck, and Renato Renner · 2010
Earlier work this paper cites.
Random oracles in a quantum world
Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry · 2011
Earlier work this paper cites.
How to construct quantum random functions
Mark Zhandry · 2012
Earlier work this paper cites.
Quantum to classical randomness extractors
Mario Berta, Omar Fawzi, and Stephanie Wehner · 2013
Earlier work this paper cites.
Holographic mutual information is monogamous
Patrick Hayden, Matthew Headrick, and Alexander Maloney · 2013
Earlier work this paper cites.
A quantum lower bound for distinguishing random functions from random permutations
Henry Yuen · 2013
Earlier work this paper cites.
Position-based quantum cryptography: Impossibility and constructions
Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, and Christian Schaffner · 2014
Cited alongside, same era.
One-shot decoupling
Frédéric Dupuis, Mario Berta, Jürg Wullschleger, and Renato Renner · 2014
Cited alongside, same era.
Quantum information processing with finite resources: mathematical foundations
Marco Tomamichel · 2015
Cited alongside, same era.
Secure identity-based encryption in the quantum random oracle model
Mark Zhandry · 2015
Cited alongside, same era.
The complexity of quantum states and transformations: from quantum money to black holes
Scott Aaronson · 2016
Cited alongside, same era.
Complexity, action, and black holes
Adam R Brown, Daniel A Roberts, Leonard Susskind, Brian Swingle, and Ying Zhao · 2016
Estimating the entropy of shallow circuit outputs is hard
Alexandru Gheorghiu and Matty J Hoban · 2020
Later among the works it cites.
Principles of quantum communication theory: A modern approach
Sumeet Khatri and Mark M Wilde · 2020
Later among the works it cites.
Holographic scattering requires a connected entanglement wedge
Alex May, Geoff Penington, and Jonathan Sorce · 2020
Later among the works it cites.
General properties of quantum bit commitments
Jun Yan · 2020
Later among the works it cites.
Leading order corrections to the quantum extremal surface prescription
Chris Akers and Geoff Penington · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits
Florian Speelman · 2016
Cited alongside, same era.
Computational complexity and black hole horizons
Leonard Susskind · 2016
Cited alongside, same era.
Mark Zhandry · 2016
Cited alongside, same era.
Entropic uncertainty relations and their applications
Patrick J Coles, Mario Berta, Marco Tomamichel, and Stephanie Wehner · 2017
Cited alongside, same era.
Computational notions of quantum min-entropy
Yi-Hsiu Chen, Kai-Min Chung, Ching-Yi Lai, Salil P Vadhan, and Xiaodi Wu · 2017
Cited alongside, same era.
Pseudorandom quantum states
Zhengfeng Ji, Yi-Kai Liu, and Fang Song · 2018
Cited alongside, same era.
Zvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh Vazirani, and Thomas Vidick · 2021
Later among the works it cites.
A world without pythons would be so simple
Netta Engelhardt, Geoff Penington, and Arvin Shahbazi-Moghaddam · 2021
Later among the works it cites.
Quantum pseudorandomness and classical complexity
William Kretschmer · 2021
Later among the works it cites.
Holographic quantum tasks with input and output regions
Alex May · 2021
Later among the works it cites.
Quantum pseudoentanglement
Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh Vazirani, Chenyi Zhang, and Zixin Zhou · 2022
Later among the works it cites.
Cryptography from pseudorandom quantum states
Prabhanjan Ananth, Luowen Qian, and Henry Yuen · 2022
Later among the works it cites.
Going beyond er=epr in the syk model
Micha Berkooz, Nadav Brukner, Simon F Ross, and Masataka Watanabe · 2022
Later among the works it cites.
On the computational hardness needed for quantum cryptography
Zvika Brakerski, Ran Canetti, and Luowen Qian · 2022
Later among the works it cites.
Complexity and entanglement in non-local computation and holography
Alex May · 2022
Later among the works it cites.
Quantum commitments and signatures without one-way functions
Tomoyuki Morimae and Takashi Yamakawa · 2022
Later among the works it cites.
Chris Akers, Adam Levine, Geoff Penington, and Elizabeth Wildenhain · 2023
Closest in time.
On the computational hardness needed for quantum cryptography
Zvika Brakerski, Ran Canetti, and Luowen Qian · 2023
Closest in time.
Unitary complexity and the uhlmann transformation problem
John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, and Henry Yuen · 2023
Closest in time.
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh Vazirani, Chenyi Zhang, and Zixin Zhou · 2023
Closest in time.