Presentation
A Divide-and-conquer Pebbling Strategy for Oracle Synthesis in Quantum Computing
DescriptionThe state-of-the-art method for oracle synthesis in quantum computing is based on logic networks, where each node corresponds to an output or an intermediate state requiring uncomputation cleanup. The order in which we compute and uncompute these nodes, sometimes referred to as the reversible pebble game, is a key factor influencing the number of qubits and the circuit length in the final result. In this paper, we introduce a novel pebbling strategy based on divide-and-conquer that aims at reducing the number of qubits while maintaining a reasonable circuit length. Our results show that our algorithm beats previous heuristic method in both number of qubits and circuit length, having the potential in tackling large-scale oracle synthesis problems.
Event Type
Work-in-Progress Poster
TimeWednesday, June 265:00pm - 6:00pm PDT
LocationLevel 2 Lobby
AI
Autonomous Systems
Cloud
Design
EDA
Embedded Systems
IP
Security