.png){kind=icon}
返回
Scalable algorithm simplification using quantum AND logic
.png){kind=icon}
OA
AI
DOI：10.1038/s41567-022-01813-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Implementing quantum algorithms on realistic devices requires translating high-level global operations into sequences of hardware-native logic gates, a process known as quantum compiling. Physical limitations, such as constraints in connectivity and gate alphabets, often result in unacceptable implementation costs. To enable successful near-term applications, it is crucial to optimize compilation by exploiting the capabilities of existing hardware. Here we implement a resource-efficient construction for a quantum version of AND logic that can reduce the compilation overhead, enabling the execution of key quantum circuits. On a high-scalability superconducting quantum processor, we demonstrate low-depth synthesis of high-fidelity generalized Toffoli gates with up to 8 qubits and Grover's search algorithm in a search space of up to 64 entries. Our experimental demonstration illustrates a scalable and widely applicable approach to implementing quantum algorithms, bringing more meaningful quantum applications on noisy devices within reach. To run algorithms on a computer they are broken down into logical operations that are implemented in hardware. A quantum logical AND gate has now been demonstrated, which could substantially improve the efficiency of near-term quantum computers.
期刊
IF:
18.4
论文数:
6.7K
被引数:
5.7W
机构
引用论文
High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits (May, 10.1038/s41567-022-01590-3, 2022).png)
NATURE PHYSICSOAAI
NATURE PHYSICSIF18.4
OAAI分享收藏分享收藏分享收藏Simplifying quantum logic using higher-dimensional Hilbert spaces使用高维希尔伯特空间简化量子逻辑NATURE PHYSICS
OAAI
NATURE PHYSICSIF18.4
OAAI分享收藏
查看更多内容