Fetching the paper…
Reading the bibliography…
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks.
“A mathematical theory of communication”
Claude. Shannon · 1948
Earlier work this paper cites.
“Breakdown of predictability in gravitational collapse”
Stephen Hawking · 1976
Earlier work this paper cites.
“The “transition probability” in the state space of a ∗ * -algebra”
Armin Uhlmann · 1976
Earlier work this paper cites.
“The Knowledge Complexity of Interactive Proof Systems”
Shafi Goldwasser, Silvio Micali and Charles Rackoff · 1989
Earlier work this paper cites.
“One-way functions are essential for complexity based cryptography”
Russell Impagliazzo and Michael Luby · 1989
Earlier work this paper cites.
“One-Shot Decoupling”
Frédéric Dupuis, Mario Berta, Jürg Wullschleger and Renato Renner · 1990
Earlier work this paper cites.
“Non-deterministic exponential time has two-prover interactive protocols”
László Babai, Lance Fortnow and Carsten Lund · 1991
Earlier work this paper cites.
“Bit commitment using pseudorandomness”
Moni Naor · 1991
Earlier work this paper cites.
“One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs.”
Rafail Ostrovsky · 1991
Earlier work this paper cites.
“Algebraic methods for interactive proof systems”
Carsten Lund, Lance Fortnow, Howard Karloff and Noam Nisan · 1992
Earlier work this paper cites.
“Do Black Holes Destroy Information?”
John Preskill · 1992
Earlier work this paper cites.
“ 𝖨𝖯 = 𝖯𝖲𝖯𝖠𝖢𝖤 \mathsf{IP}=\mathsf{PSPACE} ”
Adi Shamir · 1992
Earlier work this paper cites.
“A personal view of average-case complexity”
Russell Impagliazzo · 1995
Earlier work this paper cites.
“Quantum coding”
Benjamin Schumacher · 1995
Earlier work this paper cites.
“On Relationships between Statistical Zero-Knowledge Proofs”
Tatsuaki Okamoto · 1996
Earlier work this paper cites.
“Unconditionally Secure Quantum Bit Commitment is Impossible”
Dominic Mayers · 1997
Earlier work this paper cites.
“ 𝖭𝖯 \mathsf{NP} -completeness: A retrospective”
Christos. Papadimitriou · 1997
Earlier work this paper cites.
“The intractability of computing the minimum distance of a code”
Alexander Vardy · 1997
Earlier work this paper cites.
“Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge”
Oded Goldreich, Amit Sahai and Salil Vadhan · 1998
Earlier work this paper cites.
“Why quantum bit commitment and ideal quantum coin tossing are impossible” Proceedings of the Fourth Workshop on Physics and Consumption
Hoi-Kwong Lo and H.F. Chau · 1998
Earlier work this paper cites.
“Space-Bounded Quantum Complexity”
John Watrous · 1999
Earlier work this paper cites.
“Coding theorem and strong converse for quantum channels”
Andreas Winter · 1999
Earlier work this paper cites.
“Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems”
Alexei Kitaev and John Watrous · 2000
Earlier work this paper cites.
“How to Convert the Flavor of a Quantum Bit Commitment”
Claude Crépeau, Frédéric Légaré and Louis Salvail · 2001
Earlier work this paper cites.
“Approximation algorithms”
Vijay Vazirani · 2001
Earlier work this paper cites.
“Limits on the power of quantum statistical zero-knowledge”
John Watrous · 2002
Earlier work this paper cites.
“On the inherent intractability of certain coding problems (corresp.)”
Elwyn Berlekamp, Robert McEliece and Henk Van · 2003
Earlier work this paper cites.
“On Cryptographic Assumptions and Challenges”
Moni Naor · 2003
Earlier work this paper cites.
“A Complete Problem for Statistical Zero Knowledge”
Amit Sahai and Salil Vadhan · 2003
Earlier work this paper cites.
“Improved simulation of stabilizer circuits”
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
“On the Complexity of Quantum Languages”, 2004
Elham Kashefi and Carolina Alves · 2004
Earlier work this paper cites.
“Average-case complexity”
Andrej Bogdanov and Luca Trevisan · 2006
Earlier work this paper cites.
“Zero-Knowledge against Quantum Attacks”
John Watrous · 2006
Cited alongside, same era.
“The learnability of quantum states”
Scott Aaronson · 2007
Cited alongside, same era.
“Quantum t t -designs: t t -wise independence in the quantum world”
Andris Ambainis and Joseph Emerson · 2007
Cited alongside, same era.
“Quantum Versus Classical Proofs and Advice”
Scott Aaronson and Greg Kuperberg · 2007
Cited alongside, same era.
“A Decoupling Approach to the Quantum Capacity”
Patrick Hayden, Michał Horodecki, Andreas Winter and Jon Yard · 2008
Cited alongside, same era.
“On the Hardness of Detecting Macroscopic Superpositions”, 2020
Scott Aaronson, Yosi Atia and Leonard Susskind · 2009
Cited alongside, same era.
“Quantum Information Theory”
Mark. Wilde · 2017
Later among the works it cites.
“Pseudorandom Quantum States”
Zhengfeng Ji, Yi-Kai Liu and Fang Song · 2018
Later among the works it cites.
“Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)”
Adam Bouland, Bill Fefferman and Umesh Vazirani · 2020
Later among the works it cites.
“Predicting many properties of a quantum system from very few measurements”
Hsin-Yuan Huang, Richard Kueng and John Preskill · 2020
Later among the works it cites.
“On One-way Functions and Kolmogorov Complexity”
Yanyi Liu and Rafael Pass · 2020
Later among the works it cites.
“Improved Quantum Data Analysis”
Costin Bădescu and Ryan O’Donnell · 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…
“The Mother of All Protocols: Restructuring Quantum Information’s Family Tree”
Anura Abeyesinghe, Igor Devetak, Patrick Hayden and Andreas Winter · 2009
Cited alongside, same era.
“The decoupling approach to quantum information theory”, 2009
Frédéric Dupuis · 2009
Cited alongside, same era.
“The Operational Meaning of Min- and Max-Entropy”
Robert Konig, Renato Renner and Christian Schaffner · 2009
Cited alongside, same era.
“A Fully Quantum Asymptotic Equipartition Property”
Marco Tomamichel, Roger Colbeck and Renato Renner · 2009
Cited alongside, same era.
“Quantum Computation and Quantum Information: 10th Anniversary Edition”
Michael. Nielsen and Isaac. Chuang · 2010
Cited alongside, same era.
“The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory”
Mario Berta, Matthias Christandl and Renato Renner · 2011
Cited alongside, same era.
“On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round”
Nai-Hui Chia, Kai-Min Chung, Qipeng Liu and Takashi Yamakawa · 2021
Later among the works it cites.
“Eliminating intermediate measurements in space-bounded quantum computation”
Bill Fefferman and Zachary Remscrim · 2021
Later among the works it cites.
“Eliminating intermediate measurements using pseudorandom generators”
Uma Girish and Ran Raz · 2021
Later among the works it cites.
“ 𝖬𝖨𝖯 ∗ = 𝖱𝖤 \mathsf{MIP}^{*}=\mathsf{RE} ”
Zhengfeng Ji et al · 2021
Later among the works it cites.
“Quantum Pseudorandomness and Classical Complexity”
William Kretschmer · 2021
Later among the works it cites.
“Quantum algorithmic measurement”
Dorit Aharonov, Jordan Cotler and Xiao-Liang Qi · 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.
“Quantum Commitments and Signatures Without One-Way Functions”
Tomoyuki Morimae and Takashi Yamakawa · 2022
Later among the works it cites.
“Quantum Information Theory”
Joseph. Renes · 2022
Later among the works it cites.
“Interactive Proofs for Synthesizing Quantum States and Unitaries”
Gregory Rosenthal and Henry Yuen · 2022
Later among the works it cites.
“General Properties of Quantum Bit Commitments (Extended Abstract)”
Jun Yan · 2022
Later among the works it cites.
“The Complexity Zoo” Accessed: 2023-04-01, https://complexityzoo.net/Complexity_Zoo , 2023
Scott Aaronson · 2023
Closest in time.
“A qubit, a coin, and an advice string walk into a relational problem”
Scott Aaronson, Harry Buhrman and William Kretschmer · 2023
Closest in time.
“Computational Entanglement Theory”, 2023
Rotem Arnon-Friedman, Zvika Brakerski and Thomas Vidick · 2023
Closest in time.
“On the Computational Hardness Needed for Quantum Cryptography”
Zvika Brakerski, Ran Canetti and Luowen Qian · 2023
Closest in time.
“Black-Hole Radiation Decoding Is Quantum Cryptography”
Zvika Brakerski · 2023
Closest in time.
“Commitments to Quantum States”
Sam Gunn, Nathan Ju, Fermi Ma and Mark Zhandry · 2023
Closest in time.
“From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments”
Minki Hhan, Tomoyuki Morimae and Takashi Yamakawa · 2023
Closest in time.
“Quantum Cryptography in Algorithmica”
William Kretschmer, Luowen Qian, Makrand Sinha and Avishay Tal · 2023
Closest in time.
“Commitments from Quantum One-Wayness”, 2023
Dakshita Khurana and Kabir Tomer · 2023
Closest in time.
“A one-query lower bound for unitary synthesis and breaking quantum cryptography”, 2023
Alex Lombardi, Fermi Ma and John Wright · 2023
Closest in time.
“ 𝗌𝗍𝖺𝗍𝖾𝖰𝖨𝖯 = 𝗌𝗍𝖺𝗍𝖾𝖯𝖲𝖯𝖠𝖢𝖤 \sf stateQIP=\sf statePSPACE ”
Tony Metger and Henry Yuen · 2023
Closest in time.
“The Complexity of Learning (Pseudo)random Dynamics of Black Holes and Other Chaotic Systems”, 2023
Lisa Yang and Netta Engelhardt · 2023
Closest in time.
“A survey on the complexity of learning quantum states”
Anurag Anshu and Srinivasan Arunachalam · 2024
Closest in time.
“An Efficient Quantum Parallel Repetition Theorem and Applications”
John Bostanci, Luowen Qian, Nicholas Spooner and Henry Yuen · 2024
Closest in time.
“Efficient quantum state synthesis with one query”
Gregory Rosenthal · 2024
Closest in time.