Optimising T-count Is Np-hard, But Optimising Parametrised Circuits Is Easy - John Van De Wetering

2025 1:00:32
Synopsis
Abstract: I will show an elementary proof that optimising T-count in quantum circuits is NP-hard. The same argument also applies ...
Download Options
Choose a download method below. All links open in new tabs.
Service Features Action
Ssvid
MP4 & MP3 • HD Quality • Browser Extension Available
Download
SaveFrom
MP4 & MP3 • HD Quality • Browser Extension Available
Download
Security Notice: These are third-party services. We recommend using antivirus software and being cautious of pop-up ads.