Reference Summary: Authors: Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang (University of Texas at Austin) ITCS - Innovations in ... Paper by Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest presented at Asiacrypt 2020 See ...

Scalable Pseudorandom Quantum States -

Authors: Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang (University of Texas at Austin) ITCS - Innovations in ... Paper by Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest presented at Asiacrypt 2020 See ... Paper by Zhengfeng Ji and Yi-Kai Liu and Fang Song, presented at Crypto 2018.

Important details found

  • Authors: Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang (University of Texas at Austin) ITCS - Innovations in ...
  • Paper by Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest presented at Asiacrypt 2020 See ...
  • Paper by Zhengfeng Ji and Yi-Kai Liu and Fang Song, presented at Crypto 2018.
  • We show that QPRGs can be based on the existence of logarithmic-output

Why this topic is useful

The goal of this page is to make Scalable Pseudorandom Quantum States easier to scan, compare, and understand before opening related resources.

Sponsored

Frequently Asked Questions

What should readers check next?

Readers should check related pages, official references, or updated sources when details matter.

Why are related topics included?

Related topics help readers compare nearby references and understand the broader subject.

What is this page about?

This page summarizes Scalable Pseudorandom Quantum States and connects it with related entries, references, and supporting context.

Related Images

Scalable Pseudorandom Quantum States
Pseudorandomness: From Quantum States to Binary Strings
"Cryptography from Pseudorandom Quantum States", presented by Henry Yuen
Pseudorandom Quantum States
Quantum Pseudorandomness and Classical Complexity
QIP2023 | Pseudorandom Quantum States, Revisited (Prabhanjan Ananth)
Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
Quantum Pseudorandomness and Classical Complexity - TQC 2021
Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity
Sponsored
View Full Details
Scalable Pseudorandom Quantum States

Scalable Pseudorandom Quantum States

Paper by Zvika Brakerski, Omri Shmueli presented at Crypto 2020 See

Pseudorandomness: From Quantum States to Binary Strings

Pseudorandomness: From Quantum States to Binary Strings

We show that QPRGs can be based on the existence of logarithmic-output

"Cryptography from Pseudorandom Quantum States", presented by Henry Yuen

"Cryptography from Pseudorandom Quantum States", presented by Henry Yuen

Read more details and related context about "Cryptography from Pseudorandom Quantum States", presented by Henry Yuen.

Pseudorandom Quantum States

Pseudorandom Quantum States

Paper by Zhengfeng Ji and Yi-Kai Liu and Fang Song, presented at Crypto 2018.

Quantum Pseudorandomness and Classical Complexity

Quantum Pseudorandomness and Classical Complexity

Read more details and related context about Quantum Pseudorandomness and Classical Complexity.

QIP2023 | Pseudorandom Quantum States, Revisited (Prabhanjan Ananth)

QIP2023 | Pseudorandom Quantum States, Revisited (Prabhanjan Ananth)

Read more details and related context about QIP2023 | Pseudorandom Quantum States, Revisited (Prabhanjan Ananth).

Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications

Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications

Paper by Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest presented at Asiacrypt 2020 See ...

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

Authors: Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang (University of Texas at Austin) ITCS - Innovations in ...

Quantum Pseudorandomness and Classical Complexity - TQC 2021

Quantum Pseudorandomness and Classical Complexity - TQC 2021

Read more details and related context about Quantum Pseudorandomness and Classical Complexity - TQC 2021.

Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity

Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity

Read more details and related context about Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity.