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:2006.03075 · Quantum Science and Technology

Quantum computer-aided design of quantum optics hardware

Jakob S. Kottmann, Mario Krenn, Thi Ha Kyaw, Sumner Alperin-Lea, Alán Aspuru‐Guzik

Published Apr 28, 2021• 27 citations
arXivHTMLPDF

Abstract

Abstract The parameters of a quantum system grow exponentially with the number of involved quantum particles. Hence, the associated memory requirement to store or manipulate the underlying wavefunction goes well beyond the limit of the best classical computers for quantum systems composed of a few dozen particles, leading to serious challenges in their numerical simulation. This implies that the verification and design of new quantum devices and experiments are fundamentally limited to small system size. It is not clear how the full potential of large quantum systems can be exploited. Here, we present the concept of quantum computer designed quantum hardware and apply it to the field of quantum optics. Specifically, we map complex experimental hardware for high-dimensional, many-body entangled photons into a gate-based quantum circuit. We show explicitly how digital quantum simulation of Boson sampling experiments can be realized. We then illustrate how to design quantum-optical setups for complex entangled photonic systems, such as high-dimensional Greenberger–Horne–Zeilinger states and their derivatives. Since photonic hardware is already on the edge of quantum supremacy and the development of gate-based quantum computers is rapidly advancing, our approach promises to be a useful tool for the future of quantum device design.

DOI
10.1088/2058-9565/abfc94

Related papers

Design Methods for Reliable Quantum Circuits

Alexandru Paler

Quantum computing is an emerging technology that has the potential to change the perspectives and applications of computing in general. A wide range of applications are enabled: from faster algorithmic solutions of classically still difficult problems to theoretically more secure communication protocols. A quantum computer uses the quantum mechanical effects of particles or particle-like systems, and a major similarity between quantum and classical computers consists of both being abstracted as information processing machines. Whereas a classical computer operates on classical digital information, the quantum computer processes quantum information, which shares similarities with analog signals. One of the central differences between the two types of information is that classical information is more fault-tolerant when compared to its quantum counterpart. Faults are the result of the quantum systems being interfered by external noise, but during the last decades quantum error correction codes (QECC) were proposed as methods to reduce the effect of noise. Reliable quantum circuits are the result of designing circuits that operate directly on encoded quantum information, but the circuit’s reliability is also increased by supplemental redundancies, such as sub-circuit repetitions. Reliable quantum circuits have not been widely used, and one of the major obstacles is their vast associated resource overhead, but recent quantum computing architectures show promising scalabilities. Consequently the number of particles used for computing can be more easily increased, and that the classical control hardware (inherent for quantum computation) is also more reliable. Reliable quantum circuits haev been investigated for almost as long as general quantum computing, but their limited adoption (until recently) has not generated enough interest into their systematic design. The continuously increasing practical relevance of reliability motivates the present thesis to investigate some of the first answers to questions related to the background and the methods forming a reliable quantum circuit design stack. The specifics of quantum circuits are analysed from two perspectives: their probabilistic behaviour and their topological properties when a particular class of QECCs are used. The quantum phenomena, such as entanglement and superposition, are the computational resources used for designing quantum circuits. The discrete nature of classical information is missing for quantum information. An arbitrary quantum system can be in an infinite number of states, which are linear combinations of an exponential number of basis states. Any nontrivial linear combination of more than one basis states is called a state superposition. The effect of superpositions becomes evident when the state of the system is inferred (measured), as measurements are probabilistic with respect to their output: a nontrivial state superposition will collapse to one of the component basis states, and the measurement result is known exactly only after the measurement. A quantum system is, in general, composed from identical subsystems, meaning that a quantum computer (the complete system) operates on multiple similar particles (subsystems). Entanglement expresses the impossibility of separating the state of the subsystems from the state of the complete system: the nontrivial interactions between the subsystems result into a single indivisible state. Entanglement is an additional source of probabilistic behaviour: by measuring the state of a subsystem, the states of the unmeasured subsystems will probabilistically collapse to states from a well defined set of possible states. Superposition and entanglement are the building blocks of quantum information teleportation protocols, which in turn are used in state-of-the-art fault-tolerant quantum computing architectures. Information teleportation implies that the state of a subsystem is moved to a second subsystem without copying any information during the process. The probabilistic approach towards the design of quantum circuits is initiated by the extension of classical test and diagnosis methods. Quantum circuits are modelled similarly to classical circuits by defining gate-lists, and missing quantum gates are modelled by the single missing gate fault. The probabilistic approaches towards quantum circuits are facilitated by comparing these to stochastic circuits, which are a particular type of classical digital circuits. Stochastic circuits can be considered an emulation of analogue computing using digital components. A first proposed design method, based on the direct comparison, is the simulation of quantum circuits using stochastic circuits by mapping each quantum gate to a stochastic computing sub-circuit. The resulting stochastic circuit is compiled and simulated on FPGAs. The obtained results are encouraging and illustrate the capabilities of the proposed simulation technique. However, the exponential number of possible quantum basis states was translated into an exponential number of stochastic computing elements. A second contribution of the thesis is the proposal of test and diagnosis methods for both stochastic and quantum circuits. Existing verification (tomographic) methods of quantum circuits were targeting the reconstruction of the gate-lists. The repeated execution of the quantum circuit was followed by different but specific measurement at the circuit outputs. The similarities between stochastic and quantum circuits motivated the proposal of test and diagnosis methods that use a restricted set of measurement types, which minimise the number of circuit executions. The obtained simulation results show that the proposed validation methods improve the feasibility of quantum circuit tomography for small and medium size circuits. A third contribution of the thesis is the algorithmic formalisation of a problem encountered in teleportation-based quantum computing architectures. The teleportation results are probabilistic and require corrections represented as quantum gates from a particular set. However, there are known commutation properties of these gates with the gates used in the circuit. The corrections are not applied as dynamic gate insertions (during the circuit’s execution) into the gate-lists, but their effect is tracked through the circuit, and the corrections are applied only at circuit outputs. The simulation results show that the algorithmic solution is applicable for very large quantum circuits. Topological quantum computing (TQC) is based on a class of fault-tolerant quantum circuits that use the surface code as the underlying QECC. Quantum information is encoded in lattice-like structures and error protection is enabled by the topological properties of the lattice. The 3D structure of the lattice allows TQC computations to be visualised similarly to knot diagrams. Logical information is abstracted as strands and strand interactions (braids) represent logical quantum gates. Therefore, TQC circuits are abstracted using a geometrical description, which allows circuit input-output transformations (correlations) to be represented as geometric sub-structures. TQC design methods were not investigated prior to this work, and the thesis introduces the topological computational model by first analysing the necessary concepts. The proposed TQC design stack follows a top-down approach: an arbitrary quantum circuit is decomposed into the TQC supported gate set; the resulting circuit is mapped to a lattice of appropriate dimensions; relevant resulting topological properties are extracted and expressed using graphs and Boolean formulas. Both circuit representations are novel and applicable to TQC circuit synthesis and validation. Moreover, the Boolean formalism is broadened into a formal mechanism for proving circuit correctness. The thesis introduces TQC circuit synthesis, which is based on a novel logical gate geometric description, whose formal correctness is demonstrated. Two synthesis methods are designed, and both use a general planar representation of the circuit. Initial simulation results demonstrate the practicality and performance of the methods. An additional group of proposed design methods solves the problem of automatic correlation construction. The methods use validity criteria which were introduced and analysed beforehand in the thesis. Input-output correlations existing in the circuit are inferred using both the graph and the Boolean representation. The thesis extends the TQC state-of-the-art by recognising the importance of correlations in the validation process: correlation construction is used as a sub-routine for TQC circuit validation. The presented cross-layer validation procedure is useful when investigating both the QECC and the circuit, while a second proposed method is QECC-independent. Both methods are scalable and applicable even to very large circuits. The thesis completes with the analysis of TQC circuit identities, where the developed Boolean formalism is used. The proofs of former known circuit identities were either missing or complex, and the presented approach reduces the length of the proofs and represents a first step towards standardising them. A new identity is developed and detailed during the process of illustrating the known circuit identities. Reliable quantum circuits are a necessity for quantum computing to become reality, and specialised design methods are required to support the quest for scalable quantum computers. This thesis used a twofold approach towards this target: firstly by focusing on the probabilistic behaviour of quantum circuits, and secondly by considering the requirements of a promising quantum computing architecture, namely TQC. Both approaches resulted in a set of design methods enabling the investigation of reliable quantum circuits. The thesis contributes with the proposal of a new quantum simulation technique, no

•Jan 1, 2015•3 citations

Algorithms and protocols for quantum information technologies

Robert J. Chapman

Quantum technologies harness the properties of controlled quantum mechanical systems for applications in computation, communication and metrology, and enable us to further our understanding of fundamental physics. Quantum hardware is designed to manipulate complex and fragile many-particle quantum states, which requires exquisite control machinery, advanced software and near-complete isolation from the surrounding environment. With sufficient capabilities, quantum computers with large registers of quantum bits will perform classically intractable calculations such as quantum chemistry simulations. Quantum key distribution will provide completely secure communications across the world and quantum metrology will enable measurement precision beyond today's capabilities. While quantum technologies are far from surpassing classical hardware today, the vision and potential impact has sparked a world-wide research effort, both theoretical and experimental, to develop a quantum computer. The most sophisticated current quantum technologies have control over small numbers of quantum bits and are limited by environmental decoherence processes. While progress in developing quantum hardware is ongoing, designing and demonstrating new algorithms and protocols for quantum information is a thriving research field. Photonics provides an ideal platform for small-scale proof-of-concept quantum experiments, which are the focus of this thesis. In the coming decades, we will see the realisation of quantum hardware capable of applications that outperform any classical computer. In this thesis, I present several protocols and algorithms for quantum information science and technology, which are implemented in quantum photonic experiments. The applications of these works include robust quantum tomography, quantum state relocation, quantum enhanced data recovery and probing fundamental causality in quantum mechanics. The works presented here are based on two photon experiments from a prototypical spontaneous parametric down-conversion source, which provides an excellent test-bed for quantum information experiments. Photons can be used to encode quantum information in a range of different degrees of freedom. This versatility, along with compatibility with existing technology gives photonics a great advantage in the development of quantum hardware.

•Feb 13, 2018•0 citations

Single photons in linear optics: quantum computing and quantum simulations

Malaquias Correa Anguita

This dissertation explores the use of single photons in integrated photonic circuits as a platform for quantum computation and quantum simulation. In the noisy intermediate-scale quantum (NISQ) era, photonic implementations of boson sampling provide one of the most promising routes to demonstrating quantum advantage, while also enabling insight-driven experiments that probe many-body interference and computational complexity. The first part of the thesis is devoted to the hardware development and characterization of programmable silicon nitride photonic processors. We demonstrate large-scale multi-photon interference in a 20-mode universal processor, establishing the potential of integrated photonics for scaling up boson sampling experiments. In parallel, we introduce a validation protocol based on detector binning, implemented on a 12-mode predecessor of the device. Together, these studies advance the photonic platform itself, focusing on scalability, versatility, and benchmarking, rather than direct applications. The second part turns to quantum simulation. We first present a photonic simulation of a spin-foam amplitude from loop quantum gravity, illustrating how multi-photon interference can provide a testbed for problems in fundamental physics. We then implement a particle-number-difference Maxwell demon using conditional operations on photon subsets in a multi-mode interferometer. This experiment probes the link between thermodynamics and information theory, showing how a photonic platform with single-photon resolution and quantum interference can be used to explore information-driven control of physical systems. The final part addresses quantum computation, where we demonstrate a boson-sampling-accelerated Monte Carlo integrator. This hybrid quantum–classical algorithm represents one of the few proposals to extend boson sampling toward practical applications while plausibly retaining its computational hardness. We validate the method in a proof-of-principle experiment reproducing perturbative corrections in a model inspired by Efimov physics. Altogether, the results presented in this thesis position integrated photonics as both a scalable hardware platform for multi-photon experiments and a versatile tool for advancing quantum simulation and computation.

•Sep 23, 2025•0 citations

Entangled-Multi-Body Quantum Simulation

Jincheng Zhang

This paper explores the potential of utilizing entangled multi-body states for enhanced quantum simulation. Traditional quantum simulation methods face limitations when simulating complex quantum systems, primarily due to their inability to effectively represent multi-particle correlations. We propose a novel approach leveraging the inherent properties of entangled states to achieve a more accurate and efficient simulation of these systems. Specifically, we examine the construction of quantum computers incorporating multi-body entangled states and their application to simulating quantum field theories, a domain where complex many-body interactions are prevalent. The core idea centers on exploiting the correlations encoded within entangled states to reduce the computational complexity associated with simulating high-dimensional quantum systems. We present a theoretical framework outlining the key challenges and potential strategies for realizing this approach, focusing on the design of appropriate quantum circuits and the optimization of entanglement protocols. The ultimate goal is to demonstrate a pathway towards simulating intricate quantum phenomena that are currently intractable using conventional simulation techniques. The simulation method is based on mapping the problem to a quantum computer. The quantum computer performs the simulation based on the state of the qubits. The final result is the answer to the original problem. The key mathematical tool is the quantum circuit. The quantum circuit is a series of quantum gates applied to qubits. The quantum gates are unitary transformations. The unitary transformations are represented by matrices. The matrix is a square matrix. The matrix is a linear transformation. The linear transformation is a transformation that preserves linear relationships. The eigenvalues of the matrix are the solutions to the equation det(A - λI) = 0, where A is the matrix and λ is the eigenvalue and I is the identity matrix. The eigenvectors of the matrix are the vectors that are transformed to themselves by the matrix. The eigenvectors are the solutions to the equation (A - λI)v = 0, where A is the matrix, λ is the eigenvalue and v is the eigenvector. The eigenvalues and eigenvectors are important concepts in linear algebra.

•Aug 29, 2026•0 citations

การสร้างคิวบิตโพลาไรซ์จากแหล่งกำเนิดโฟตอนคู่และการออกแบบโครงสร้างทางเลือกแบบตั้งโปรแกรมได้อย่างอิสระของเกททางแสงหลายคิวบิต

Paphon Phewkhom

Due to the potential of quantum computers to revolutionize computation by solving some types of traditionally intractable problems by the classical computer, this field of study has become increasingly active and diverse, involving work on developing quantum processing hardware as well as research into applications with a potential large speed-up compared to simulations on classical (non-quantum) computers. One of the most promising methods for processing quantum information involves the use of photonic qubits, which allow for well-established and noise-free single-qubit operations. However, since there is no photon-photon interaction, processing the qubit-interaction property requires a nonlinear optical operation. Therefore, in the experiment section of this project, we created entangled photonic qubits by beginning with photon pair generation using a nonlinear crystal, then building up the complexity of the optical setup with the Hong-Oa-Mandel dip experiment, CHSH experiments, and eventually, photonic qubit generation and tomography. By optimizing the efficiency of the system in each experiment, the resultant qubit was successfully constructed with high fidelity to the designated Bell’s state. Additionally, we experimented with the optical structure of the photon pairs loop, which delivered some issues with noise and low signal in the results. Nonetheless, the structure still showed potential to be improved and utilized in future experiments. The entangled qubits and photon loop created in this project can be used as a foundation for various quantum optic algorithms, especially the photon loop structure, which can be used for the iteration of an operator, which is used regularly in the standard method for constructing multi-qubit gates. However, the method has some limitations in that only unitary operators can be created. Finally, in the second section of this project, we explored an alternative scheme for constructing quantum optical multi-qubit gates. This purposed scheme, which uses the Hilbert-space expansion technique, is capable of independently programming each matrix element of the operator, allowing many different types of quantum operators to be realized in quantum optic experiments. The advanced scheme can theoretically achieve n-polarization-qubit optical reconfigurable quantum gates by arranging linear optical elements.

•Jan 1, 2022•0 citations

The race for quantum supremacy: pushing the classical limit for photonic hardware

Nicolò Spagnolo, Fabio Sciarrino

The strong efforts towards the realization of scalable quantum computing are motivated by the promise of super-polynomial speed-up in several computational tasks. A first fundamental step in this route is to provide concrete evidence of ‘quantum supremacy'. Such a regime is obtained when a quantum device is capable of solving a specific problem faster than the best classical hardware. A serious attempt to provide a first demonstration of quantum speed-up with affordable resources is represented by boson sampling [1,2], a non-universal quantum-computational protocol exploiting indistinguishable single photons and linear optical devices. In this context, strong theoretical evidence has been reported that the interference pattern generated by a boson sampler is hard to simulate with classical resources, this pattern being related to the calculation of a hard-to-compute quantity known as a matrix permanent. Formal achievement of the regime of quantum supremacy will answer two very relevant questions: Are we able to benefit from the power of quantum mechanics or does there exist a fundamental reason why this achievement is forbidden? Once this regime has been achieved, are we able to certify the correct functioning of the quantum boson samplers or do we face an undecidability problem? Starting from these intriguing and promising theoretical results, an experimental race kicked off with the aim of reaching the quantum supremacy regime with boson sampling by employing a photonic platform [3]. A large amount of effort has been devoted to pushing the limits of current photonic systems [1], in order to significantly increase the size (number of photons and optical modes) that can be handled with a quantum device. In parallel to this quest for improved quantum performance, it is fundamental to benchmark the limits of a classical simulation of boson sampling. More specifically, in the race for quantum supremacy, what is the best possible classical simulation that can be performed? Such an analysis would be necessary to define the computational capacity possessed by such a classical agent to perform the task (see Fig. 1). In the race for quantum supremacy, a user who employs the best classical hardware and software, and a second agent who exploits a quantum device compete to solve the boson sampling task faster. In a recent article, Wu et al. [4] have provided a fundamental step to define and push the limits of a classical simulation of boson sampling. The authors have employed Tianhe-2, one of the world's most powerful super-computers, to perform such a task. More specifically, by using such high-performance computing hardware and by employing the fastest algorithm to date, Wu et al. have shown that calculating the permanent of a |$50 \times 50$| matrix can be performed in 100 min. Recent results [5] have shown that this computation corresponds to the classical hardness of drawing a 50-photon sample from a boson sampling distribution. The strong computational capacity of Tianhe-2 also allowed us to address the precision that the known fastest classical algorithms can reach in such a large-scale calculation. This latter aspect is indeed of fundamental importance, since any reliable classical computation must be accompanied by an appropriate error analysis. The study reported in Ref. [4] represents by far the largest calculation to date related to the classical simulation of boson sampling, whose relevance can be found in two different but related aspects. First, it raises the bar for any quantum implementation aimed at reaching quantum advantage, and provides a fundamental benchmark to which any photonic hardware must compare. This result suggests that a larger effort must be dedicated to pushing quantum technologies in this direction. Second, improved classical simulation also has important consequences in the context of boson sampling certification, i.e. the verification that a quantum device is correctly performing the required task. Indeed, first validation procedures in the quantum advantage regime must be assisted by powerful classical computational resources that, while requiring longer processing time than quantum hardware, will necessarily have to perform complex calculations.

National Science Review•Nov 6, 2018•11 citations
Abstract The parameters of a quantum system grow exponentially with the number of involved quantum particles. Hence, the associated memory requirement to store or manipulate the underlying wavefunction goes well beyond the limit of the best classical computers for quantum systems composed of a few dozen particles, leading to serious challenges in their numerical simulation. This implies that the verification and design of new quantum devices and experiments are fundamentally limited to small system size. It is not clear how the full potential of large quantum systems can be exploited. Here, we present the concept of quantum computer designed quantum hardware and apply it to the field of quantum optics. Specifically, we map complex experimental hardware for high-dimensional, many-body entangled photons into a gate-based quantum circuit. We show explicitly how digital quantum simulation of Boson sampling experiments can be realized. We then illustrate how to design quantum-optical setups for complex entangled photonic systems, such as high-dimensional Greenberger–Horne–Zeilinger states and their derivatives. Since photonic hardware is already on the edge of quantum supremacy and the development of gate-based quantum computers is rapidly advancing, our approach promises to be a useful tool for the future of quantum device design.
Quantum computing is an emerging technology that has the potential to change the perspectives and applications of computing in general. A wide range of applications are enabled: from faster algorithmic solutions of classically still difficult problems to theoretically more secure communication protocols. A quantum computer uses the quantum mechanical effects of particles or particle-like systems, and a major similarity between quantum and classical computers consists of both being abstracted as information processing machines. Whereas a classical computer operates on classical digital information, the quantum computer processes quantum information, which shares similarities with analog signals. One of the central differences between the two types of information is that classical information is more fault-tolerant when compared to its quantum counterpart. Faults are the result of the quantum systems being interfered by external noise, but during the last decades quantum error correction codes (QECC) were proposed as methods to reduce the effect of noise. Reliable quantum circuits are the result of designing circuits that operate directly on encoded quantum information, but the circuit’s reliability is also increased by supplemental redundancies, such as sub-circuit repetitions. Reliable quantum circuits have not been widely used, and one of the major obstacles is their vast associated resource overhead, but recent quantum computing architectures show promising scalabilities. Consequently the number of particles used for computing can be more easily increased, and that the classical control hardware (inherent for quantum computation) is also more reliable. Reliable quantum circuits haev been investigated for almost as long as general quantum computing, but their limited adoption (until recently) has not generated enough interest into their systematic design. The continuously increasing practical relevance of reliability motivates the present thesis to investigate some of the first answers to questions related to the background and the methods forming a reliable quantum circuit design stack. The specifics of quantum circuits are analysed from two perspectives: their probabilistic behaviour and their topological properties when a particular class of QECCs are used. The quantum phenomena, such as entanglement and superposition, are the computational resources used for designing quantum circuits. The discrete nature of classical information is missing for quantum information. An arbitrary quantum system can be in an infinite number of states, which are linear combinations of an exponential number of basis states. Any nontrivial linear combination of more than one basis states is called a state superposition. The effect of superpositions becomes evident when the state of the system is inferred (measured), as measurements are probabilistic with respect to their output: a nontrivial state superposition will collapse to one of the component basis states, and the measurement result is known exactly only after the measurement. A quantum system is, in general, composed from identical subsystems, meaning that a quantum computer (the complete system) operates on multiple similar particles (subsystems). Entanglement expresses the impossibility of separating the state of the subsystems from the state of the complete system: the nontrivial interactions between the subsystems result into a single indivisible state. Entanglement is an additional source of probabilistic behaviour: by measuring the state of a subsystem, the states of the unmeasured subsystems will probabilistically collapse to states from a well defined set of possible states. Superposition and entanglement are the building blocks of quantum information teleportation protocols, which in turn are used in state-of-the-art fault-tolerant quantum computing architectures. Information teleportation implies that the state of a subsystem is moved to a second subsystem without copying any information during the process. The probabilistic approach towards the design of quantum circuits is initiated by the extension of classical test and diagnosis methods. Quantum circuits are modelled similarly to classical circuits by defining gate-lists, and missing quantum gates are modelled by the single missing gate fault. The probabilistic approaches towards quantum circuits are facilitated by comparing these to stochastic circuits, which are a particular type of classical digital circuits. Stochastic circuits can be considered an emulation of analogue computing using digital components. A first proposed design method, based on the direct comparison, is the simulation of quantum circuits using stochastic circuits by mapping each quantum gate to a stochastic computing sub-circuit. The resulting stochastic circuit is compiled and simulated on FPGAs. The obtained results are encouraging and illustrate the capabilities of the proposed simulation technique. However, the exponential number of possible quantum basis states was translated into an exponential number of stochastic computing elements. A second contribution of the thesis is the proposal of test and diagnosis methods for both stochastic and quantum circuits. Existing verification (tomographic) methods of quantum circuits were targeting the reconstruction of the gate-lists. The repeated execution of the quantum circuit was followed by different but specific measurement at the circuit outputs. The similarities between stochastic and quantum circuits motivated the proposal of test and diagnosis methods that use a restricted set of measurement types, which minimise the number of circuit executions. The obtained simulation results show that the proposed validation methods improve the feasibility of quantum circuit tomography for small and medium size circuits. A third contribution of the thesis is the algorithmic formalisation of a problem encountered in teleportation-based quantum computing architectures. The teleportation results are probabilistic and require corrections represented as quantum gates from a particular set. However, there are known commutation properties of these gates with the gates used in the circuit. The corrections are not applied as dynamic gate insertions (during the circuit’s execution) into the gate-lists, but their effect is tracked through the circuit, and the corrections are applied only at circuit outputs. The simulation results show that the algorithmic solution is applicable for very large quantum circuits. Topological quantum computing (TQC) is based on a class of fault-tolerant quantum circuits that use the surface code as the underlying QECC. Quantum information is encoded in lattice-like structures and error protection is enabled by the topological properties of the lattice. The 3D structure of the lattice allows TQC computations to be visualised similarly to knot diagrams. Logical information is abstracted as strands and strand interactions (braids) represent logical quantum gates. Therefore, TQC circuits are abstracted using a geometrical description, which allows circuit input-output transformations (correlations) to be represented as geometric sub-structures. TQC design methods were not investigated prior to this work, and the thesis introduces the topological computational model by first analysing the necessary concepts. The proposed TQC design stack follows a top-down approach: an arbitrary quantum circuit is decomposed into the TQC supported gate set; the resulting circuit is mapped to a lattice of appropriate dimensions; relevant resulting topological properties are extracted and expressed using graphs and Boolean formulas. Both circuit representations are novel and applicable to TQC circuit synthesis and validation. Moreover, the Boolean formalism is broadened into a formal mechanism for proving circuit correctness. The thesis introduces TQC circuit synthesis, which is based on a novel logical gate geometric description, whose formal correctness is demonstrated. Two synthesis methods are designed, and both use a general planar representation of the circuit. Initial simulation results demonstrate the practicality and performance of the methods. An additional group of proposed design methods solves the problem of automatic correlation construction. The methods use validity criteria which were introduced and analysed beforehand in the thesis. Input-output correlations existing in the circuit are inferred using both the graph and the Boolean representation. The thesis extends the TQC state-of-the-art by recognising the importance of correlations in the validation process: correlation construction is used as a sub-routine for TQC circuit validation. The presented cross-layer validation procedure is useful when investigating both the QECC and the circuit, while a second proposed method is QECC-independent. Both methods are scalable and applicable even to very large circuits. The thesis completes with the analysis of TQC circuit identities, where the developed Boolean formalism is used. The proofs of former known circuit identities were either missing or complex, and the presented approach reduces the length of the proofs and represents a first step towards standardising them. A new identity is developed and detailed during the process of illustrating the known circuit identities. Reliable quantum circuits are a necessity for quantum computing to become reality, and specialised design methods are required to support the quest for scalable quantum computers. This thesis used a twofold approach towards this target: firstly by focusing on the probabilistic behaviour of quantum circuits, and secondly by considering the requirements of a promising quantum computing architecture, namely TQC. Both approaches resulted in a set of design methods enabling the investigation of reliable quantum circuits. The thesis contributes with the proposal of a new quantum simulation technique, no
Quantum technologies harness the properties of controlled quantum mechanical systems for applications in computation, communication and metrology, and enable us to further our understanding of fundamental physics. Quantum hardware is designed to manipulate complex and fragile many-particle quantum states, which requires exquisite control machinery, advanced software and near-complete isolation from the surrounding environment. With sufficient capabilities, quantum computers with large registers of quantum bits will perform classically intractable calculations such as quantum chemistry simulations. Quantum key distribution will provide completely secure communications across the world and quantum metrology will enable measurement precision beyond today's capabilities. While quantum technologies are far from surpassing classical hardware today, the vision and potential impact has sparked a world-wide research effort, both theoretical and experimental, to develop a quantum computer. The most sophisticated current quantum technologies have control over small numbers of quantum bits and are limited by environmental decoherence processes. While progress in developing quantum hardware is ongoing, designing and demonstrating new algorithms and protocols for quantum information is a thriving research field. Photonics provides an ideal platform for small-scale proof-of-concept quantum experiments, which are the focus of this thesis. In the coming decades, we will see the realisation of quantum hardware capable of applications that outperform any classical computer. In this thesis, I present several protocols and algorithms for quantum information science and technology, which are implemented in quantum photonic experiments. The applications of these works include robust quantum tomography, quantum state relocation, quantum enhanced data recovery and probing fundamental causality in quantum mechanics. The works presented here are based on two photon experiments from a prototypical spontaneous parametric down-conversion source, which provides an excellent test-bed for quantum information experiments. Photons can be used to encode quantum information in a range of different degrees of freedom. This versatility, along with compatibility with existing technology gives photonics a great advantage in the development of quantum hardware.
This dissertation explores the use of single photons in integrated photonic circuits as a platform for quantum computation and quantum simulation. In the noisy intermediate-scale quantum (NISQ) era, photonic implementations of boson sampling provide one of the most promising routes to demonstrating quantum advantage, while also enabling insight-driven experiments that probe many-body interference and computational complexity. The first part of the thesis is devoted to the hardware development and characterization of programmable silicon nitride photonic processors. We demonstrate large-scale multi-photon interference in a 20-mode universal processor, establishing the potential of integrated photonics for scaling up boson sampling experiments. In parallel, we introduce a validation protocol based on detector binning, implemented on a 12-mode predecessor of the device. Together, these studies advance the photonic platform itself, focusing on scalability, versatility, and benchmarking, rather than direct applications. The second part turns to quantum simulation. We first present a photonic simulation of a spin-foam amplitude from loop quantum gravity, illustrating how multi-photon interference can provide a testbed for problems in fundamental physics. We then implement a particle-number-difference Maxwell demon using conditional operations on photon subsets in a multi-mode interferometer. This experiment probes the link between thermodynamics and information theory, showing how a photonic platform with single-photon resolution and quantum interference can be used to explore information-driven control of physical systems. The final part addresses quantum computation, where we demonstrate a boson-sampling-accelerated Monte Carlo integrator. This hybrid quantum–classical algorithm represents one of the few proposals to extend boson sampling toward practical applications while plausibly retaining its computational hardness. We validate the method in a proof-of-principle experiment reproducing perturbative corrections in a model inspired by Efimov physics. Altogether, the results presented in this thesis position integrated photonics as both a scalable hardware platform for multi-photon experiments and a versatile tool for advancing quantum simulation and computation.
This paper explores the potential of utilizing entangled multi-body states for enhanced quantum simulation. Traditional quantum simulation methods face limitations when simulating complex quantum systems, primarily due to their inability to effectively represent multi-particle correlations. We propose a novel approach leveraging the inherent properties of entangled states to achieve a more accurate and efficient simulation of these systems. Specifically, we examine the construction of quantum computers incorporating multi-body entangled states and their application to simulating quantum field theories, a domain where complex many-body interactions are prevalent. The core idea centers on exploiting the correlations encoded within entangled states to reduce the computational complexity associated with simulating high-dimensional quantum systems. We present a theoretical framework outlining the key challenges and potential strategies for realizing this approach, focusing on the design of appropriate quantum circuits and the optimization of entanglement protocols. The ultimate goal is to demonstrate a pathway towards simulating intricate quantum phenomena that are currently intractable using conventional simulation techniques. The simulation method is based on mapping the problem to a quantum computer. The quantum computer performs the simulation based on the state of the qubits. The final result is the answer to the original problem. The key mathematical tool is the quantum circuit. The quantum circuit is a series of quantum gates applied to qubits. The quantum gates are unitary transformations. The unitary transformations are represented by matrices. The matrix is a square matrix. The matrix is a linear transformation. The linear transformation is a transformation that preserves linear relationships. The eigenvalues of the matrix are the solutions to the equation det(A - λI) = 0, where A is the matrix and λ is the eigenvalue and I is the identity matrix. The eigenvectors of the matrix are the vectors that are transformed to themselves by the matrix. The eigenvectors are the solutions to the equation (A - λI)v = 0, where A is the matrix, λ is the eigenvalue and v is the eigenvector. The eigenvalues and eigenvectors are important concepts in linear algebra.
Due to the potential of quantum computers to revolutionize computation by solving some types of traditionally intractable problems by the classical computer, this field of study has become increasingly active and diverse, involving work on developing quantum processing hardware as well as research into applications with a potential large speed-up compared to simulations on classical (non-quantum) computers. One of the most promising methods for processing quantum information involves the use of photonic qubits, which allow for well-established and noise-free single-qubit operations. However, since there is no photon-photon interaction, processing the qubit-interaction property requires a nonlinear optical operation. Therefore, in the experiment section of this project, we created entangled photonic qubits by beginning with photon pair generation using a nonlinear crystal, then building up the complexity of the optical setup with the Hong-Oa-Mandel dip experiment, CHSH experiments, and eventually, photonic qubit generation and tomography. By optimizing the efficiency of the system in each experiment, the resultant qubit was successfully constructed with high fidelity to the designated Bell’s state. Additionally, we experimented with the optical structure of the photon pairs loop, which delivered some issues with noise and low signal in the results. Nonetheless, the structure still showed potential to be improved and utilized in future experiments. The entangled qubits and photon loop created in this project can be used as a foundation for various quantum optic algorithms, especially the photon loop structure, which can be used for the iteration of an operator, which is used regularly in the standard method for constructing multi-qubit gates. However, the method has some limitations in that only unitary operators can be created. Finally, in the second section of this project, we explored an alternative scheme for constructing quantum optical multi-qubit gates. This purposed scheme, which uses the Hilbert-space expansion technique, is capable of independently programming each matrix element of the operator, allowing many different types of quantum operators to be realized in quantum optic experiments. The advanced scheme can theoretically achieve n-polarization-qubit optical reconfigurable quantum gates by arranging linear optical elements.
The strong efforts towards the realization of scalable quantum computing are motivated by the promise of super-polynomial speed-up in several computational tasks. A first fundamental step in this route is to provide concrete evidence of ‘quantum supremacy'. Such a regime is obtained when a quantum device is capable of solving a specific problem faster than the best classical hardware. A serious attempt to provide a first demonstration of quantum speed-up with affordable resources is represented by boson sampling [1,2], a non-universal quantum-computational protocol exploiting indistinguishable single photons and linear optical devices. In this context, strong theoretical evidence has been reported that the interference pattern generated by a boson sampler is hard to simulate with classical resources, this pattern being related to the calculation of a hard-to-compute quantity known as a matrix permanent. Formal achievement of the regime of quantum supremacy will answer two very relevant questions: Are we able to benefit from the power of quantum mechanics or does there exist a fundamental reason why this achievement is forbidden? Once this regime has been achieved, are we able to certify the correct functioning of the quantum boson samplers or do we face an undecidability problem? Starting from these intriguing and promising theoretical results, an experimental race kicked off with the aim of reaching the quantum supremacy regime with boson sampling by employing a photonic platform [3]. A large amount of effort has been devoted to pushing the limits of current photonic systems [1], in order to significantly increase the size (number of photons and optical modes) that can be handled with a quantum device. In parallel to this quest for improved quantum performance, it is fundamental to benchmark the limits of a classical simulation of boson sampling. More specifically, in the race for quantum supremacy, what is the best possible classical simulation that can be performed? Such an analysis would be necessary to define the computational capacity possessed by such a classical agent to perform the task (see Fig. 1). In the race for quantum supremacy, a user who employs the best classical hardware and software, and a second agent who exploits a quantum device compete to solve the boson sampling task faster. In a recent article, Wu et al. [4] have provided a fundamental step to define and push the limits of a classical simulation of boson sampling. The authors have employed Tianhe-2, one of the world's most powerful super-computers, to perform such a task. More specifically, by using such high-performance computing hardware and by employing the fastest algorithm to date, Wu et al. have shown that calculating the permanent of a |50×5050 \times 5050×50| matrix can be performed in 100 min. Recent results [5] have shown that this computation corresponds to the classical hardness of drawing a 50-photon sample from a boson sampling distribution. The strong computational capacity of Tianhe-2 also allowed us to address the precision that the known fastest classical algorithms can reach in such a large-scale calculation. This latter aspect is indeed of fundamental importance, since any reliable classical computation must be accompanied by an appropriate error analysis. The study reported in Ref. [4] represents by far the largest calculation to date related to the classical simulation of boson sampling, whose relevance can be found in two different but related aspects. First, it raises the bar for any quantum implementation aimed at reaching quantum advantage, and provides a fundamental benchmark to which any photonic hardware must compare. This result suggests that a larger effort must be dedicated to pushing quantum technologies in this direction. Second, improved classical simulation also has important consequences in the context of boson sampling certification, i.e. the verification that a quantum device is correctly performing the required task. Indeed, first validation procedures in the quantum advantage regime must be assisted by powerful classical computational resources that, while requiring longer processing time than quantum hardware, will necessarily have to perform complex calculations.