The following pages link to Michele Mosca (Q477169):
Displaying 36 items.
- Public-key cryptography based on bounded quantum reference frames (Q477170) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- A low-resource quantum factoring algorithm (Q1673618) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 (Q1698647) (← links)
- Quantum networks for concentrating entanglement (Q2766210) (← links)
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits (Q2985686) (← links)
- (Q3000895) (← links)
- The Case for Quantum Key Distribution (Q3064339) (← links)
- Generalized Self-testing and the Security of the 6-State Protocol (Q3070981) (← links)
- A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing Public Keys (Q3102797) (← links)
- (Q3172442) (← links)
- Self-testing of universal and fault-tolerant sets of quantum gates (Q3192043) (← links)
- (Q3410550) (← links)
- Unconditionally-Secure and Reusable Public-Key Authentication (Q3453315) (← links)
- LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS (Q3534100) (← links)
- Self-testing of Quantum Circuits (Q3613750) (← links)
- Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph (Q4212881) (← links)
- Quantum algorithms revisited (Q4223937) (← links)
- (Q4240342) (← links)
- (Q4449183) (← links)
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication. (Q4637981) (← links)
- EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS (Q4674243) (← links)
- (Q4819589) (← links)
- Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search (Q4928590) (← links)
- Quantum Key Distribution in the Classical Authenticated Key Exchange Framework (Q4928593) (← links)
- (Q4939150) (← links)
- Quantum–enhanced information processing (Q4946457) (← links)
- On the robustness of bucket brigade quantum RAM (Q5144324) (← links)
- Efficient discrete-time simulations of continuous-time quantum query algorithms (Q5172735) (← links)
- T-Count Optimization and Reed–Muller Codes (Q5224110) (← links)
- On the Robustness of Bucket Brigade Quantum RAM (Q5278032) (← links)
- Optimal phase estimation in quantum networks (Q5296077) (← links)
- Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates (Q5386215) (← links)
- Quantum lower bounds by polynomials (Q5441359) (← links)
- Graphical CSS Code Transformation Using ZX Calculus (Q6200518) (← links)
