Pages that link to "Item:Q5313028"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313028):
Displaying 14 items.
- Symmetric quantum fully homomorphic encryption with perfect security (Q479359) (← links)
- Secure sequential transmission of quantum information (Q747822) (← links)
- On almost randomizing channels with a short Kraus decomposition (Q842484) (← links)
- Entropic security in quantum cryptography (Q1039614) (← links)
- Random quantum circuits are approximate 2-designs (Q1048095) (← links)
- Randomizing quantum states: constructions and applications (Q1766903) (← links)
- On the mixed-unitary rank of quantum channels (Q2165051) (← links)
- Quantum encryption and generalized Shannon impossibility (Q2324779) (← links)
- Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\) (Q2517965) (← links)
- On the optimality of quantum encryption schemes (Q3442020) (← links)
- On the Power of Quantum Encryption Keys (Q3535360) (← links)
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker (Q5445521) (← links)
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates (Q6165434) (← links)
- Entropically secure encryption with faster key expansion (Q6492513) (← links)
