Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2210.09251 · IEEE/ACM International Workshop on Quantum Computing Software (QCS)

A compiler for universal photonic quantum computers

Felix Zilk, Korbinian Staudacher, Tobias Guggemos, Karl Fürlinger, Dieter August Kranzlmüller, Philip John Walther

Published Nov 1, 2022• 15 citations
arXivHTMLPDF

Abstract

Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require particularly strongly sealed environments, making them an appealing platform for quantum computing. With the one-way model, the vision of a universal and largescale quantum computer based on photonics becomes feasible. In one-way computing, the input state is not an initial product state$\vert\boldsymbol{0}\rangle^{\otimes n}$, but a socalled cluster state. A series of measurements on the cluster state's individual qubits and their temporal order, together with a feed-forward procedure, determine the quantum circuit to be executed. We propose a pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer. In addition, we optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.

DOI
10.1109/qcs56647.2022.00012

Related papers

Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model

A. Matthew Smith, Paul M. Alsing, Gordon E. Lott +1 more

We provide a set of prescriptions for implementing a circuit model algorithm as measurement-based quantum computing algorithm via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single-photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

Journal of Modern Optics•Mar 24, 2015•1 citation

On-chip generation of multi-qubit graph states with high-dimensional encoded single photons

Lan-Tian Feng, Bo-Hao Zhang, Di Liu +5 more

Photonic multi-qubit entanglement is key to optical quantum information processing, particularly universal quantum computing. Yet multi-photon sources suffer from low emission efficiency, making single-photon high-dimensional encoding an appealing alternative. Here we propose an explicit and resource-efficient high-dimensional encoding approach to achieve the target multi-qubit quantum state. The technically challenging preparation of multi-photon quantum states is replaced by single-photon operations involving high-dimensional expansion, routing, and multi-layered quantum measurement. Besides, each photon in the resource multi-photon quantum state can be used to encode multiple qubits in a distributed manner, and a larger entangled state will be constructed. We demonstrate this approach using programmable photonic integrated circuits, where multi-qubit graph states--including the Greenberger-Horne-Zeilinger state and the cluster state--are generated and characterized. We additionally demonstrate the Grover search algorithm using the single-photon cluster state. Our findings unlock a novel route towards diverse entangled state generation with photons and advance large-scale and universal photonic quantum information processing.

quant-pharXiv:2608.03012•Aug 5, 2026•0 citations

Translating Non-Trivial Algorithms from the Circuit Model to the Measurement

A. Matthew Smith, Paul M. Alsing, Gordon E. Lott +1 more

We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

Journal of Modern Optics•Jan 1, 2015•0 citations

Extracting one-way quantum computation patterns from quantum circuits

Mahboobeh Houshmand, Mohammad Hossein Samavatian, Morteza Saheb Zamani +1 more

In one-way quantum computations (1WQC), quantum correlations in an entangled state, called a cluster or graph state, are exploited to perform universal quantum computations using single-qubit measurements. The choices of bases for these measurements as well as the structure of the entanglements specify a quantum algorithm. The needed computations in this model are organized as patterns. Previously, an approach to extract a 1WQC pattern from a quantum circuit was proposed. The approach takes a quantum circuit consisting of only CZ andj(oc) gates and translates it into a 1WQC pattern after performing some known optimizations. However, most quantum synthesis algorithms decompose circuits using a library containing CNOT and any single-qubit gates. In this paper, we show how this approach can be modified in a way that it can take a circuit consisting of CNOT and any single-qubit gates as well as CZ and J(oc) gates to produce a 1WQC pattern. Experimental results show that adding CNOT gate directly to the pattern decreases the translation run-time.

CSI International Symposium on Computer Architecture and Digital Systems (CADS)•May 1, 2012•4 citations

Measurement-based quantum computation on cluster states

Robert Raussendorf, Dan E. Browne, Hans J. Briegel

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.

arXiv:quant-ph/0301052•Physical Review A•Aug 25, 2003•1,650 citations

Silicon photonic quantum computing with spin qubits

Xiruo Yan, Sebastian Gitt, Becky Lin +11 more

Universal quantum computing holds the promise to fundamentally change today’s information-based society, yet a hardware platform that will provide a clear path to fault-tolerant quantum computing remains elusive. One recently proposed platform involves the use of circuit-bound photons to build cluster states and perform one-way measurement-based quantum computations on arrays of long-coherence-time solid-state spin qubits. Herein, we discuss the challenges that are faced during any practical implementation of this architecture by itemizing the key physical building blocks and the constraints imposed on the spin qubits and the photonic circuit components by the requirements of fault-tolerant performance. These considerations point to silicon as a leading candidate to host such a platform, and a roadmap for developing a silicon photonic circuit-based platform for measurement-based, fault-tolerant universal quantum computing is offered.

APL Photonics•Jul 1, 2021•50 citations
Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require particularly strongly sealed environments, making them an appealing platform for quantum computing. With the one-way model, the vision of a universal and largescale quantum computer based on photonics becomes feasible. In one-way computing, the input state is not an initial product state∣0⟩⊗n\vert\boldsymbol{0}\rangle^{\otimes n}∣0⟩⊗n, but a socalled cluster state. A series of measurements on the cluster state's individual qubits and their temporal order, together with a feed-forward procedure, determine the quantum circuit to be executed. We propose a pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer. In addition, we optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.
We provide a set of prescriptions for implementing a circuit model algorithm as measurement-based quantum computing algorithm via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single-photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).
Photonic multi-qubit entanglement is key to optical quantum information processing, particularly universal quantum computing. Yet multi-photon sources suffer from low emission efficiency, making single-photon high-dimensional encoding an appealing alternative. Here we propose an explicit and resource-efficient high-dimensional encoding approach to achieve the target multi-qubit quantum state. The technically challenging preparation of multi-photon quantum states is replaced by single-photon operations involving high-dimensional expansion, routing, and multi-layered quantum measurement. Besides, each photon in the resource multi-photon quantum state can be used to encode multiple qubits in a distributed manner, and a larger entangled state will be constructed. We demonstrate this approach using programmable photonic integrated circuits, where multi-qubit graph states--including the Greenberger-Horne-Zeilinger state and the cluster state--are generated and characterized. We additionally demonstrate the Grover search algorithm using the single-photon cluster state. Our findings unlock a novel route towards diverse entangled state generation with photons and advance large-scale and universal photonic quantum information processing.
We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).
In one-way quantum computations (1WQC), quantum correlations in an entangled state, called a cluster or graph state, are exploited to perform universal quantum computations using single-qubit measurements. The choices of bases for these measurements as well as the structure of the entanglements specify a quantum algorithm. The needed computations in this model are organized as patterns. Previously, an approach to extract a 1WQC pattern from a quantum circuit was proposed. The approach takes a quantum circuit consisting of only CZ andj(oc) gates and translates it into a 1WQC pattern after performing some known optimizations. However, most quantum synthesis algorithms decompose circuits using a library containing CNOT and any single-qubit gates. In this paper, we show how this approach can be modified in a way that it can take a circuit consisting of CNOT and any single-qubit gates as well as CZ and J(oc) gates to produce a 1WQC pattern. Experimental results show that adding CNOT gate directly to the pattern decreases the translation run-time.
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of practical interest such as the circuit for quantum Fourier transformation and for the quantum adder. Finally, we describe computation with clusters of finite size.
Universal quantum computing holds the promise to fundamentally change today’s information-based society, yet a hardware platform that will provide a clear path to fault-tolerant quantum computing remains elusive. One recently proposed platform involves the use of circuit-bound photons to build cluster states and perform one-way measurement-based quantum computations on arrays of long-coherence-time solid-state spin qubits. Herein, we discuss the challenges that are faced during any practical implementation of this architecture by itemizing the key physical building blocks and the constraints imposed on the spin qubits and the photonic circuit components by the requirements of fault-tolerant performance. These considerations point to silicon as a leading candidate to host such a platform, and a roadmap for developing a silicon photonic circuit-based platform for measurement-based, fault-tolerant universal quantum computing is offered.