Physical synthesis of quantum circuits using Q-learning
From MaRDI portal
Cites work
- A first course in graph theory and combinatorics
- Algorithmic graph theory and perfect graphs
- Applied probability and stochastic processes
- Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm
- Experimental realization of quantum cheque using a five-qubit quantum computer
- Finding Optimal Implementations of Non-native CNOT Gates Using SAT
- scientific article; zbMATH DE number 5076264 (Why is no real title available?)
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- Quantum computing. A gentle introduction
- Reinforcement learning for combinatorial optimization: a survey
- Reinforcement learning. An introduction
- Reversible computation. Third international workshop, RC 2011, Gent, Belgium, July 4--5, 2011. Revised papers
- T-count optimized Wallace tree integer multiplier for quantum computing
This page was built for publication: Physical synthesis of quantum circuits using Q-learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010285)