Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning 论文

2014IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems引用 277
DOIArXivPDF
Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum-Dot Cellular Automata
网络安全Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum-Dot Cellular Automata
相关技术:Quantum Computing Algorithms and Architecture
关系图谱

Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning · 作者

M

Michele Mosca

D

Dmitri Maslov

M

Matthew Amy