Synthetiq: Fast and Versatile Quantum Circuit Synthesis
summary
Synthetiq uses Simulated Annealing with a domain-specific energy function and a custom simplification pass to synthesize circuits over arbitrary finite gate sets, supporting exact, ε-approximate, and partial (isometry/relative-phase) specifications. It finds smaller circuits for operators like RCCCX, CCiSWAP and C√SWAP, typically one to two orders of magnitude faster than prior tools (up to 10^4× in some cases), often reducing T-count or ancilla use; practical limits hit around 5 qubits, with memory issues by 7 qubits.
AI-written summary · about
chapters (13)
- 0:00Quantum circuit synthesis intro
- 2:09Native gate sets
- 3:10Approximate synthesis
- 6:40Problem statement & annealing
- 8:48Circuit simplification
- 10:15Performance comparison
- 11:19Real-world operators
- 12:23Q&A: Recomputing M & code
- 13:27Q&A: Qubit/gate limits
- 14:52Q&A: Worst-case performance
- 16:41Q&A: Other gate sets
- 17:22Q&A: 100-qubit scaling
- 19:11Q&A: Large circuit decomposition
related talks
15mModular Component-Based Quantum Circuit Synthesis
24mSynthesizing Quantum-Circuit Optimizers
17mQuantum Applications with Classiq
22mHow to Synthesize Quantum-Circuit Optimizers
19mExtracting maximum value from today's quantum computers while prep
23mA Case for Synthesis of Recursive Quantum Unitary Programs
17mOptimization and Synthesis of Quantum Circuits with Global Gates
24mOptimal synthesis into fixed XX interactions