SDSimon J. Devitt

Simon J. Devitt

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Simon J. Devitt has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Superconducting qubits in the millions: The potential and limitations of modularity

    by S.N. Saadatmand, Tyler L. Wilson, Mark J. Hodson, Mark Field, Simon J. Devitt, Madhav Krishnan Vijayan, Alan Robertson, Thinh P. Le, Jannis Ruh, Alexandru Paler, et al.

    The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, which utilize error correction and millions of physical qubits, have the potential to address some of humanity’s grand challenges. However, accurate estimates of the tangible scale of future FTQCs, based on transparent assumptions, are uncommon. How many physical qubits are necessary to solve a practical problem intractable for classical hardware? What costs arise from distributing quantum computation across multiple machines? This paper presents an architectural model of a potential FTQC based on superconducting qubits, divided into discrete modules and interconnected via coherent links. We employ a resource-estimation framework and software tool to assess the physical resources required to execute specific quantum algorithms compiled into their graph-state form and arranged onto a modular superconducting hardware architecture. Our tool can predict the size, power consumption, and execution time of these algorithms based on explicit assumptions about the physical layout, thermal load, and modular connectivity of the system. We assess the resources needed for quantum computation examples that serve as building blocks of proposed applications, quantifying the architectural bottlenecks and trade-offs that remain to be addressed to deliver utility.

  • Open Access

    Near-deterministic photon entanglement from a spin qudit in silicon using third quantization

    by Gözde Üstün, Samuel J Elman, Jarryd J. Pla, Andrew C Doherty, Andrea Morello, Simon J. Devitt

    Unlike other quantum hardware, photonic quantum architectures can produce millions of qubits from a single device. However, controlling photonic qubits remains challenging, even at small scales, due to their weak interactions, making nondeterministic gates in linear optics unavoidable. Nevertheless, a single photon can readily spread over multiple modes and create entanglement within the multiple modes deterministically. Rudolph’s concept of third quantization leverages this feature by evolving multiple single photons into multiple modes, distributing them uniformly and randomly to different parties, and creating multipartite entanglement without interactions between photons or nondeterministic gates. This method requires only classical communication and deterministic entanglement within multimode single-photon states and enables universal quantum computing. The multipartite entanglement generated within the third-quantization framework is nearly deterministic, where “deterministic” is achieved in the asymptotic limit of a large system size. In this work, we propose a near-term experiment using antimony donor in a silicon chip to realize third quantization. Utilizing the eight energy levels of antimony, one can generate two eight-mode single-photon states independently and distribute them to parties. This enables a random multipartite Bell-state experiment, achieving a Bell state with an upper-bound efficiency of 87.5% among 56 random pairs without nondeterministic entangling gates. This approach opens alternative pathways for silicon-based photonic quantum computing.


  • Open Access

    Comparing schemes for creating qudit graph states from 16- and 128-dimensional Hilbert space using donors in silicon

    by Gözde Üstün, Simon J. Devitt

    In this work, we compare two schemes for generating arbitrary qudit graph states using spin qudits in silicon. The first scheme proposes the creation of qudit linear graph states from a single emitter—a silicon spin qudit. By employing fusion—a destructive and nondeterministic measurement technique—these linear graphs can then be combined to form more complex resource states (multiphoton entangled states), such as ring or ladder structures, which are used to carry out the computation. The second scheme employs two spin qudits. Instead of relying on fusion, the two emitters are directly coupled via controlled-Z gate to generate the same resource states, thereby eliminating the need for fusion. We compare the two schemes in terms of their ability to produce equivalent resource states and discuss their respective advantages and limitations for building scalable architectures.


  • Open Access

    Quantum circuits for simulating linear interferometers

    by Hudson Leone, Peter S. Turner, Simon Devitt

    Motivated by recent proposals for quantum proof of work protocols, we investigate approaches for simulating linear optical interferometers using digital quantum circuits. We focus on a second quantization approach, where the quantum computer's registers represent optical modes. We can then use standard quantum optical techniques to decompose the unitary matrix describing an interferometer into an array of 2 × 2 unitaries, which are subsequently synthesized into quantum circuits and stitched together to complete the circuit. For an m -mode interferometer with n identical photons, this method requires approximately O ( m log ( n ) ) qubits and a circuit depth of O ( m n 4 log 2 ( n ) polylog ( n 4 / ε ) ) . We present a software package aquinas (a quantum interferometer assembler) that uses this approach to generate such quantum circuits. For reference, an arbitrary five-mode interferometer with two identical photons is compiled to a ten-qubit quantum circuit with a depth of 1972.

  • Open Access

    Quantum entanglement distribution via uplink satellite channels

    by S. Srikara, Hudson Leone, Alexander S. Solntsev, Simon J. Devitt

    Significant work has been done to develop quantum satellites, which generate entangled pairs in space and distribute them to ground stations separated some distance away. The reverse “uplink” case, where pairs are generated on the ground and swapped on the satellite using an optical Bell measurement, has not been seriously considered due to a prevailing assumption that it is practically infeasible. In this paper, we illustrate the feasibility of performing Discrete Variable photonic Bell measurements in space by conducting a detailed numerical analysis to estimate the channel efficiency and attainable pair fidelity for various satellite-station configurations. Our model accounts for a wide range of physical effects such as atmospheric effects, stray photons, and mode mismatch. Our findings show promise toward the feasibility of photonic Bell measurements in space, which motivates future research toward large-scale satellite-based uplink entanglement distribution.


  • Open Access

    Compare the pair: Rotated versus unrotated surface codes at equal logical error rates

    by Anthony Ryan O'Rourke, Simon Devitt

    Practical quantum computers will require resource-efficient error-correcting codes. The rotated surface code uses approximately half the number of qubits as the unrotated surface code to create a logical qubit with the same error-correcting distance. However, instead of distance, a more useful qubit-saving metric would be based on logical error rates. In this work we find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes at high odd and even distances and then compare the number of qubits used by each code to achieve equal logical error rates. We perform Monte Carlo sampling of memory experiment circuits with all valid CNOT orders using the stabilizer simulator Stim and the uncorrelated minimum-weight perfect matching decoder PyMatching 2. We find that the rotated code uses about 74 % the number of qubits used by the unrotated code to achieve a logical error rate of p L = 10 − 12 at the operational physical error rate of p = 10 − 3 . The ratio remains ≈ 75 % for p values within a factor of two of p = 10 − 3 for all useful p L . Our work finds the low- p L scaling of the surface code and clarifies the qubit savings provided by the rotated surface code, providing numerical justification for its use in future implementations of the surface code.


  • Open Access

    Multiplexed pseudo-deterministic photon source with asymmetric switching elements

    by Sebastian Brandhofer, Casey R. Myers, Simon Devitt, Ilia Polian

    The reliable, deterministic production of trustworthy high-quality single photons is a critical component of discrete variable, optical quantum technology. For single-photon based fully error-corrected quantum computing systems, it is estimated that photon sources will be required to produce a reliable stream of photons at rates exceeding 1 GHz (Vigliar et al., 2021). Photon multiplexing, where low probability sources are combined with switching networks to route successful production events to an output, are a potential solution but requires extremely fast single-photon switching with ultra-low-loss rates. In this paper, we examine the specific properties of the switching elements and present a new design that exploits the general one-way properties of common switching elements such as thermal pads. By introducing multiple switches to a basic, temporal multiplexing device, we can use slow switching elements in a multiplexed source being pumped at much faster rates. We model this design under multiple error channels and show that anticipated performance is now limited by the intrinsic loss rate of the optical waveguides within integrated photonic chipsets. While the developed design does not achieve the necessary 1 GHz photon rate, we demonstrate design elements that could become useful when underlying technology improves.


  • Open Access

    Single-step parity check gate set for quantum error correction

    by Gözde Üstün, Andrea Morello, Simon Devitt

    A key requirement for an effective quantum error correction (QEC) scheme is that the physical qubits have error rates below a certain threshold. The value of this threshold depends on the details of the specific QEC scheme, and its hardware-level implementation. This is especially important with parity-check circuits, which are the fundamental building blocks of QEC codes. The standard way of constructing the parity check circuit is using a universal set of gates, namely sequential CNOT gates, single-qubit rotations and measurements. We exploit the insight that a QEC code does not require universal logic gates, but can be simplified to perform the sole task of error detection and correction. By building gates that are fundamental to QEC, we can boost the threshold and ease the experimental demands on the physical hardware. We present a rigorous formalism for constructing and verifying the error behavior of these gates, linking the physical measurement of a process matrix to the abstract error models commonly used in QEC analysis. This allows experimentalists to directly map the gates used in their systems to thresholds derived for a broad-class of QEC codes. We give an example of these new constructions using the model system of two nuclear spins, coupled to an electron spin, showing the potential benefits of redesigning fundamental gate sets using QEC primitives, rather than traditional gate sets reliant on simple single and two-qubit gates.


  • Open Access

    Upper Bounds for the Clock Speeds of Fault-Tolerant Distributed Quantum Computation using Satellites to Supply Entangled Photon Pairs

    by Hudson Leone, S Srikara, Peter P. Rohde, Simon Devitt

    Despite recent advances in quantum repeater networks, entanglement distribution on a continental scale remains prohibitively difficult and resource intensive. Using satellites to distribute maximally entangled photons (Bell pairs) between distant stations is an intriguing alternative. Quantum satellite networks are known to be viable for quantum key distribution, but the question of if such a network is feasible for fault tolerant distributed quantum computation (FTDQC) has so far been unaddressed. In this paper we determine a closed form expression for the rate at which logical Bell pairs can be produced between distant fault-tolerant qubits using a satellite network to supply imperfect physical Bell pairs. With generous parameter assumptions, our results show that FTDQC with satellite networks over statewide distances (500-999 km) is possible for a collective clock rate on the order of 1 MHz while continental (1000-4999 km) and transcontinental (5000+ km) distances run on the order of 10 kHz and 100 Hz respectively.

  • Open Access

    Upper bounds for the clock speeds of fault-tolerant distributed quantum computation using satellites to supply entangled photon pairs

    by Hudson Leone, S. Srikara, Peter P. Rohde, Simon Devitt

    Despite recent advances in quantum repeater networks, entanglement distribution on a continental scale remains prohibitively difficult and resource intensive. Using satellites to distribute maximally entangled photons (Bell pairs) between distant stations is an intriguing alternative. Quantum satellite networks are known to be viable for quantum key distribution, but the question of if such a network is feasible for fault tolerant distributed quantum computation (FTDQC) has so far been unaddressed. In this paper we determine a closed form expression for the rate at which logical Bell pairs can be produced between distant surface code encoded qubits using a satellite network to supply imperfect physical Bell pairs. With generous parameter assumptions, our results show that FTDQC with satellite networks over statewide distances (500–999 km) is possible up to a collective clock rate on the order of 1 MHz, while continental (1000–4999 km) and transcontinental (5000+ km) distances run on the order of 10 kHz and 100 Hz, respectively.