Commitments to quantum states
From MaRDI portal
Publication:6499324
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 3999326 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Classical binding for quantum commitments
- Classical verification of quantum computations
- Classical verification of quantum computations with efficient verifier
- Computationally binding quantum commitments
- Cryptography from pseudorandom quantum states
- Interactive proofs and the hardness of approximating cliques
- Multi-collision resistance: a paradigm for keyless hash functions
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Pseudorandom quantum states
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Quantum commitments and signatures without one-way functions
- Quantum proofs of knowledge
- Quantum rewinding for many-round protocols
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- Succinct classical verification of quantum computation
- The detectability lemma and quantum gap amplification
Cited in
(3)
This page was built for publication: Commitments to quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499324)
