1、Back-end-aware Fault-tolerant Quantum Oracle SynthesisMingfei Yu1,Alessandro Tempia Calvino1,Mathias Soeken2and Giovanni De Micheli11Integrated Systems Laboratory(LSI),EPFL,Switzerland2Microsoft Quantum,SwitzerlandJanuary 22,2025,at ASP-DAC 2025Z Mingfei Yu|twoOutlineIntroductionMotivationMethodolog
2、iesExperimental EvaluationConclusion and DiscussionZ Mingfei Yu|threeIntroduction:Quantum OraclesWhat is a quantum oracle:A quantum circuit that implements a Boolean function.Given a Boolean function f(x),an oracle Ofrealizes:|x|y|0l7|x|y f(x)|0l.Why do we need quantum oracles:Fundamental component
3、in many quantum algorithms and applications:Shors algorithm1:Realizing modular exponentiation function in phase estimation.Quantum chemistry applications2:Encoding Hamiltonian matrices.1Peter W.Shor.“Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”.In
4、:SIAM Journal on Computing 26.5(1997),pp.14841509.ISSN:1095-71112Aln Aspuru-Guzik et al.“Simulated Quantum Computation of Molecular Energies”.In:Science 309.5741(2005),pp.17041707Z Mingfei Yu|fourIntroduction:Quantum Oracle Synthesis FlowBoolean functionLogic representationLogic optimizationCompilat
5、ionQuantum oracleFuction-dependent synthesis flowGeneric constructionFuction-independent synthesis flowFunction-independent oracle synthesis:Requiring more resources than function-dependent ones but might be favored in practice.A generic construction ensures a uniform layout.Suited for cases where t
6、arget functions require frequent reconfiguration.Function-dependent oracle synthesis:XOR-AND-invertor graphs(XAGs)is an ideal logic representation.Correlation between AND nodes in an XAG and T gates in a Clifford+T oracle.Z Mingfei Yu|fourIntroduction:Quantum Oracle Synthesis FlowBoolean functionLog