Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 TPS
Gemini 2.5 Pro 55 TPS Pro
GPT-5 Medium 40 TPS
GPT-5 High 40 TPS Pro
GPT-4o 94 TPS
GPT OSS 120B 477 TPS Pro
Kimi K2 231 TPS Pro
2000 character limit reached

A generic multi-Pauli compilation framework for limited connectivity (2412.06909v1)

Published 9 Dec 2024 in quant-ph

Abstract: Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particularly suitable for limited connectivity, that extends many of the known techniques for Pauli network synthesis. Our compilation method, built on the introduced Clifford Executive Representation, stands out by considering the implementation of multiple Pauli operators at once, which are not necessarily commuting. The proposed technique also allows for effective Clifford circuit synthesis. We benchmark our methods against circuits resulting from the Variational Quantum Eigensolver algorithm and the results show that the proposed methods outperform the state-of-the-art.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube