.png){kind=icon}
返回
Compilation of algorithm-specific graph states for quantum circuits
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ad1f39.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages, such as Cirq and Q#. The computation can then be implemented using a series of non-Pauli measurements on this graph state. By compiling the graph state directly instead of starting with a standard lattice cluster state and preparing it over the course of the computation, we are able to better understand the resource costs involved and eliminate wasteful Pauli measurements on the actual quantum device. Access to this algorithm-specific graph state also allows for optimisation over locally equivalent graph states to implement the same quantum circuit. The compiler presented here finds ready application in measurement based quantum computing, NISQ devices and logical level compilation for fault tolerant implementations.
Keyword:
graph states
quantum circuit compilation
measurement based quantum computing
ICM
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
The Variational Quantum Eigensolver: A review of methods and best practices变分量子本征求解器: 方法和最佳实践的回顾
OAAI
OAAI分享收藏分享收藏
查看更多内容