Protecting quantum circuits through compiler-resistant obfuscation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2166998 (Why is no real title available?)
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithms revisited
- Quantum Complexity Theory
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computing. A gentle introduction
- Rapid solution of problems by quantum computation
This page was built for publication: Protecting quantum circuits through compiler-resistant obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411901)