A5104204557- Quantum-Dot Cellular Automata
- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Low-power high-performance VLSI design
Université Paris Cité
2024
Centre National de la Recherche Scientifique
2024
École Normale Supérieure - PSL
2024
Sorbonne Paris Cité
2024
Sorbonne Université
2024
Université Paris Sciences et Lettres
2024
Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant computation, we propose a scheme to achieve provable superpolynomial (under some widely accepted complexity conjectures) that is noise with minimal error correction requirements. We choose class sampling problems commuting gates known as sparse IQP (Instantaneous Quantum Polynomial-time) circuits ensure its implementation by introducing the tetrahelix code. This...
Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant computation, we propose a scheme to achieve provable superpolynomial (under some widely accepted complexity conjectures) that is noise with minimal error correction requirements. We choose class sampling problems commuting gates known as sparse IQP (Instantaneous Quantum Polynomial-time) circuits ensure its implementation by introducing the tetrahelix code. This...