31 March 2021
##
Modular photonic quantum computing

Rapid progress has been made in recent years in the development of fault-tolerant quantum computing (FTQC) - across theoretical foundations, architectural design and experimental implementations. Most of the proposed architectures are based on an array of static qubits, where relevant large-scale computation with for example superconducting qubits is expected to require vast numbers of physical qubits taking up a lot of space and control machinery. Directly translating that paradigm to photonic FTQC architectures, implies that photons serve as the ‘static qubits’ implementing gates and measurements. However, the implementation of long sequences required by FTQC protocols, becomes difficult to process as photons are short-lived, easily lost, and destroyed after measurement. This makes conventional FTQC description not suitable to photonic quantum computing.

Fusion-based quantum computing (FBQC) is an alternative to standard photon-based FTQC architectures that can overcome such limitations. In FBQC, quantum information is not stored in a static array of qubits, but periodically teleported from previously generated resource states to currently generated photons. Hence, even when the measured photons are destroyed, their quantum information is preserved and teleported accordingly. In this work, the authors present a modular and scalable architecture for FBQC, which can provide the computational power of thousands of physical qubits. The unit module of the architecture consists of a single resource-state generator (RSG), a few fusion devices, and macroscopic fiber delays with low transmission loss rates connected via waveguides and switches. The networks of such modules execute the operations by adding thousands of physical qubits to the computational Hilbert space for executing computation. The authors argue that, pragmatically, “a static qubit-based device and a dynamic RSG-based device (can be considered) equally powerful, if they can execute the same quantum computation in the same amount of time”. A single RSG is shown to be much more ‘powerful’ than a single physical qubit.

The qubits produced by RSGs are encoded as photonic qubits and are combined using a stabilizer code such as a Shor code. The photonic qubits are then transported by waveguides to n-delays, which delay (store) photons for n RSG cycles therefore acting as a fixed-time quantum memory by temporarily storing photonic qubits. This photonic memory is used to increase the number of simultaneously existing resource states available in the total computation space. Fusion devices further perform entangling fusion measurements of photon pairs that enter the device. Finally, switches reroute the incoming photonic qubits to one of the multiple outgoing waveguides. Switch settings can be adjusted in every RSG cycle, thereby deciding the operations to be performed.

In contrast to circuits in circuit-based quantum computation (CBQC), photonic FBQC uses fusion graphs to describe the execution of a specific computation. The authors review the structure of simple cubic fusion graphs using 6-ring graph states which is a six-qubit ring-shaped cluster state as resource states. Each resource state is fused with six other resource states allowing one fusion per constituent qubit of the resource state. Another direction being explored is interleaving, which involves allocating the same RSG to successively produce different fusion-graph resource states. Exploiting different arrangements of RSGs and using longer delay lines can lead to larger fusion graphs. Furthermore, it is demonstrated that interleaving modules with n-delays can increase the number of available qubits by n, but inevitably decrease the speed of logical operations by the same factor. To avoid that, it is recommended increasing the number of interleaving modules and investigating different arrangements.

These photonics-based FBQC architectures are not only modular and highly scalable, but are cost-efficient as well, since they reduce the cost of logical operations. Combining this with the interleaving approach further improves feasibility, where instead of million-qubit arrays of physical qubits, arrays of disconnected few-qubit devices can be turned into a large-scale quantum computer, provided that their qubits are photonic qubits. Such hybrid architecture repeatedly generates identical few qubit resource states from matter-based qubits, connecting them to a large-scale fault-tolerant quantum computer. Moreover, it also handles the classical processing associated with error correction along with providing high-capacity memory. As quantum technology evolves, larger number of high-quality qubits are going to be available, allowing a transition from small-scale FTQC devices to fully scalable devices. These early FTQC devices are expected to be similar in design to the current NISQ devices albeit much more powerful. Utilizing such approaches in photonic FBQC along with the developments in highly efficient photonic hardware can make the transition to large-scale fault-tolerant quantum computers a reality in the near future.

Fusion-based quantum computing (FBQC) is an alternative to standard photon-based FTQC architectures that can overcome such limitations. In FBQC, quantum information is not stored in a static array of qubits, but periodically teleported from previously generated resource states to currently generated photons. Hence, even when the measured photons are destroyed, their quantum information is preserved and teleported accordingly. In this work, the authors present a modular and scalable architecture for FBQC, which can provide the computational power of thousands of physical qubits. The unit module of the architecture consists of a single resource-state generator (RSG), a few fusion devices, and macroscopic fiber delays with low transmission loss rates connected via waveguides and switches. The networks of such modules execute the operations by adding thousands of physical qubits to the computational Hilbert space for executing computation. The authors argue that, pragmatically, “a static qubit-based device and a dynamic RSG-based device (can be considered) equally powerful, if they can execute the same quantum computation in the same amount of time”. A single RSG is shown to be much more ‘powerful’ than a single physical qubit.

The qubits produced by RSGs are encoded as photonic qubits and are combined using a stabilizer code such as a Shor code. The photonic qubits are then transported by waveguides to n-delays, which delay (store) photons for n RSG cycles therefore acting as a fixed-time quantum memory by temporarily storing photonic qubits. This photonic memory is used to increase the number of simultaneously existing resource states available in the total computation space. Fusion devices further perform entangling fusion measurements of photon pairs that enter the device. Finally, switches reroute the incoming photonic qubits to one of the multiple outgoing waveguides. Switch settings can be adjusted in every RSG cycle, thereby deciding the operations to be performed.

In contrast to circuits in circuit-based quantum computation (CBQC), photonic FBQC uses fusion graphs to describe the execution of a specific computation. The authors review the structure of simple cubic fusion graphs using 6-ring graph states which is a six-qubit ring-shaped cluster state as resource states. Each resource state is fused with six other resource states allowing one fusion per constituent qubit of the resource state. Another direction being explored is interleaving, which involves allocating the same RSG to successively produce different fusion-graph resource states. Exploiting different arrangements of RSGs and using longer delay lines can lead to larger fusion graphs. Furthermore, it is demonstrated that interleaving modules with n-delays can increase the number of available qubits by n, but inevitably decrease the speed of logical operations by the same factor. To avoid that, it is recommended increasing the number of interleaving modules and investigating different arrangements.

These photonics-based FBQC architectures are not only modular and highly scalable, but are cost-efficient as well, since they reduce the cost of logical operations. Combining this with the interleaving approach further improves feasibility, where instead of million-qubit arrays of physical qubits, arrays of disconnected few-qubit devices can be turned into a large-scale quantum computer, provided that their qubits are photonic qubits. Such hybrid architecture repeatedly generates identical few qubit resource states from matter-based qubits, connecting them to a large-scale fault-tolerant quantum computer. Moreover, it also handles the classical processing associated with error correction along with providing high-capacity memory. As quantum technology evolves, larger number of high-quality qubits are going to be available, allowing a transition from small-scale FTQC devices to fully scalable devices. These early FTQC devices are expected to be similar in design to the current NISQ devices albeit much more powerful. Utilizing such approaches in photonic FBQC along with the developments in highly efficient photonic hardware can make the transition to large-scale fault-tolerant quantum computers a reality in the near future.

Published in
Blog

Tagged under

28 March 2021
##
Experimental Quantum Reinforcement Learning

With the advent of more powerful classical computational power, machine learning and artificial intelligence research has made a recent resurgence in popularity and massive progress has been made in recent years in developing useful algorithms for practical applications. Meanwhile, quantum computing research has advanced to a stage where quantum supremacy has been shown experimentally, and theoretical algorithmic advantages in, for instance, machine learning have been theoretically proven. One particularly interesting machine learning paradigm is Reinforcement Learning (RL), where agents directly interact with an environment and learn by feedback exchanges. In recent years, RL has been utilized to assist in several problems in quantum information processing, such as decoding of errors, quantum feedback and adaptive code-design with significant success. Turned around, implementing ‘quantum’ RL using quantum computers has been shown to make the decision making process for RL agents quadratically faster than on classical hardware.

In most protocols so far, the interaction between the agent and the environment has been designed to occur entirely via classical communication in most RL applications. However, there is a theoretically suggested possibility of gaining increased quantum speedup, if this interaction can be transferred via quantum route. In this work, the authors propose a hybrid RL protocol that enables both quantum as well as classical information transfer between the agent and the environment. The main objective is to evaluate the comparative impact of this hybrid model on agent’s learning time with respect to RL schemes based on solely classical communication. The work uses a fully programmable nanophotonic processor interfaced with photons for the experimental implementation of the protocol. The setup implements an active feedback mechanism combining quantum amplitude amplification with a classical control mechanism that updates its learning policy.

The setup consists of a single-photon source pumped by laser light leading to the generation of a pair of single photons. One of these photons is sent to a quantum processor to perform a particular computation, while the other one is sent to a single-photon detector for heralding. Highly efficient detectors with short dead time response serve as fast feedback. Both detection events at the processor output and photon detector are recorded and registered with a time tagging module (TTM) as coincidence events. The agent and the environment are assigned different areas of the processor, performing the prior steps of the Grover-like amplitude amplification. The agent is further equipped with a classical control mechanism that updates its learning policy.

Any typical Grover-like algorithm faces a drop in the amplitude amplification after reaching the optimal point. Each agent reaches this optimal point at different epochs, therefore one can identify the probability up to which it is beneficial for all agents to use a quantum strategy over the classical strategy. The average number of interactions until the agent accomplishes a specific task is the learning time. The setup allows the agents to choose the most favorable strategy by switching from quantum to classical as soon as the second becomes more advantageous. Such combined strategy is shown to outperform the pure classical scenario.

Such a hybrid model represents a potentially interesting advantage over previously implemented protocols which are purely quantum or classical. Photonic architectures in particular are put forward by the authors to be one of the most suitable candidates for implementing these types of learning algorithms, by providing advantages of compactness, full tunability and low-loss communication which easily implements active feedback mechanisms for RL algorithms even over long distances. However, the theoretical implementation of such protocols is general and shown to be applicable to any quantum computational platform. Their results also demonstrate the feasibility of integrating quantum mechanical RL speed-ups in future complex quantum networks.

Finally, through the advancement of integrated optics towards the fabrication of increasingly large devices, such demonstration could be extended to more complex quantum circuits allowing for processing of high-dimensional states. This raises hopes for achieving superior performance in increasingly complex learning devices. Undoubtedly in the near future, AI and RL will play an important role in future large-scale quantum communication networks, including a potential quantum internet.

In most protocols so far, the interaction between the agent and the environment has been designed to occur entirely via classical communication in most RL applications. However, there is a theoretically suggested possibility of gaining increased quantum speedup, if this interaction can be transferred via quantum route. In this work, the authors propose a hybrid RL protocol that enables both quantum as well as classical information transfer between the agent and the environment. The main objective is to evaluate the comparative impact of this hybrid model on agent’s learning time with respect to RL schemes based on solely classical communication. The work uses a fully programmable nanophotonic processor interfaced with photons for the experimental implementation of the protocol. The setup implements an active feedback mechanism combining quantum amplitude amplification with a classical control mechanism that updates its learning policy.

The setup consists of a single-photon source pumped by laser light leading to the generation of a pair of single photons. One of these photons is sent to a quantum processor to perform a particular computation, while the other one is sent to a single-photon detector for heralding. Highly efficient detectors with short dead time response serve as fast feedback. Both detection events at the processor output and photon detector are recorded and registered with a time tagging module (TTM) as coincidence events. The agent and the environment are assigned different areas of the processor, performing the prior steps of the Grover-like amplitude amplification. The agent is further equipped with a classical control mechanism that updates its learning policy.

Any typical Grover-like algorithm faces a drop in the amplitude amplification after reaching the optimal point. Each agent reaches this optimal point at different epochs, therefore one can identify the probability up to which it is beneficial for all agents to use a quantum strategy over the classical strategy. The average number of interactions until the agent accomplishes a specific task is the learning time. The setup allows the agents to choose the most favorable strategy by switching from quantum to classical as soon as the second becomes more advantageous. Such combined strategy is shown to outperform the pure classical scenario.

Such a hybrid model represents a potentially interesting advantage over previously implemented protocols which are purely quantum or classical. Photonic architectures in particular are put forward by the authors to be one of the most suitable candidates for implementing these types of learning algorithms, by providing advantages of compactness, full tunability and low-loss communication which easily implements active feedback mechanisms for RL algorithms even over long distances. However, the theoretical implementation of such protocols is general and shown to be applicable to any quantum computational platform. Their results also demonstrate the feasibility of integrating quantum mechanical RL speed-ups in future complex quantum networks.

Finally, through the advancement of integrated optics towards the fabrication of increasingly large devices, such demonstration could be extended to more complex quantum circuits allowing for processing of high-dimensional states. This raises hopes for achieving superior performance in increasingly complex learning devices. Undoubtedly in the near future, AI and RL will play an important role in future large-scale quantum communication networks, including a potential quantum internet.

Published in
Blog

Tagged under

- The Inductive Bias of Quantum Kernels 07 June 2021 in Blog
- Quantum Chemistry in First Quantization 26 May 2021 in Blog
- Preparation and verification of tensor network states 14 May 2021 in Blog
- Unification of Computation 12 May 2021 in Blog
- Benchmarking Quantum Computers: what the Q? 03 May 2021 in Blog
- Quantum Architecture Learning 25 April 2021 in Blog

Copyright © Qu & Co BV