Michael Vasmer

Michael Vasmer

Auto-generated profile, based on publicly available information

Michael Vasmer

Xanadu

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 February 2021 in Quantum
Verified
Journal Article
Open access
PDF file
JBJ. Eli Bourassa
J. Eli Bourassa
RARafael N. Alexander
Rafael N. Alexander
MVMichael Vasmer
Michael Vasmer
APAshlesha Patil
Ashlesha Patil
ITIlan Tzitrin
Ilan Tzitrin
IDIsh Dhand
Ish Dhand
Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into states of light and the modern tools for their generation. Here we propose such a design for a scalable fault-tolerant photonic quantum computer informed by the latest developments in theory and technology. Central to our architecture is the generation and manipulation of three-dimensional resource states comprising both bosonic qubits and squeezed vacuum states. The proposal exploits state-of-the-art procedures for the non-deterministic generation of bosonic qubits combined with the strengths of continuous-variable quantum computation, namely the implementation of Clifford gates using easy-to-generate squeezed states. Moreover, the architecture is based on two-dimensional integrated photonic chips used to produce a qubit cluster state in one temporal and two spatial dimensions. By reducing the experimental challenges as compared to existing architectures and by enabling room-temperature quantum computation, our design opens the door to scalable fabrication and operation, which may allow photonics to leap-frog other platforms on the path to a quantum computer with millions of qubits.

22 January 2025 in Nature
Verified
Journal Article
Open access
PDF file
HRH. Aghaee Rad
H. Aghaee Rad
TAT. Ainsworth
T. Ainsworth
RAR. N. Alexander
R. N. Alexander
BAB. Altieri
B. Altieri
MAM. F. Askarani
M. F. Askarani
YZY. Zhang
Y. Zhang
Photonics offers a promising platform for quantum computing1,2,3,4, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture’s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications.

9 July 2019 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MVMichael Vasmer
Michael Vasmer
DBDan E. Browne
Dan E. Browne
One of the leading quantum computing architectures is based on the two-dimensional (2D) surface code. This code has many advantageous properties such as a high error threshold and a planar layout of physical qubits where each physical qubit need only interact with its nearest neighbors. However, the transversal logical gates available in 2D surface codes are limited. This means that an additional (resource-intensive) procedure known as magic state distillation is required to do universal quantum computing with 2D surface codes. Here, we examine three-dimensional (3D) surface codes in the context of quantum computation. We introduce a picture for visualizing 3D surface codes which is useful for analyzing stacks of three 3D surface codes. We use this picture to prove that the CZ and CCZ gates are transversal in 3D surface codes. We also generalize the techniques of 2D surface-code lattice surgery to 3D surface codes. We combine these results and propose two quantum computing architectures based on 3D surface codes. Magic state distillation is not required in either of our architectures. Finally, we show that a stack of three 3D surface codes can be transformed into a single 3D color code (another type of quantum error-correcting code) using code concatenation.

14 June 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
AQArmanda O. Quintavalle
Armanda O. Quintavalle
MVMichael Vasmer
Michael Vasmer
JRJoschka Roffe
Joschka Roffe
ECEarl T. Campbell
Earl T. Campbell
Single-shot error correction corrects data noise using only a single round of noisy measurements on the data qubits, removing the need for intensive measurement repetition. We introduce a general concept of confinement for quantum codes, which roughly stipulates qubit errors cannot grow without triggering more measurement syndromes. We prove confinement is sufficient for single-shot decoding of adversarial errors and linear confinement is sufficient for single-shot decoding of local stochastic errors. Further to this, we prove that all three-dimensional homological product codes exhibit confinement in their X components and are therefore single shot for adversarial phase-flip noise. For local stochastic phase-flip noise, we numerically explore these codes and again find evidence of single-shot protection. Our Monte Carlo simulations indicate sustainable thresholds of 3.08(4)% and 2.90(2)% for three-dimensional (3D) surface and toric codes, respectively, the highest observed single-shot thresholds to date. To demonstrate single-shot error correction beyond the class of topological codes, we also run simulations on a randomly constructed family of 3D homological product codes.

21 October 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
AKAleksander Kubica
Aleksander Kubica
MVMichael Vasmer
Michael Vasmer
Fault-tolerant protocols and quantum error correction (QEC) are essential to building reliable quantum computers from imperfect components that are vulnerable to errors. Optimizing the resource and time overheads needed to implement QEC is one of the most pressing challenges. Here, we introduce a new topological quantum error-correcting code, the three-dimensional subsystem toric code (3D STC). The 3D STC can be realized with geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions. We prove that one round of parity-check measurements suffices to perform reliable QEC with the 3D STC even in the presence of measurement errors. We also propose an efficient single-shot QEC decoding strategy for the 3D STC and numerically estimate the resulting storage threshold against independent bit-flip, phase-flip and measurement errors to bepSTC ≈ 1.045%. Such a high threshold together with local parity-check measurements make the 3D STC particularly appealing for realizing fault-tolerant quantum computing.

21 January 2021 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MVMichael Vasmer
Michael Vasmer
DBDan E. Browne
Dan E. Browne
AKAleksander Kubica
Aleksander Kubica
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, however, we focus on the three-dimensional toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We also numerically benchmark the performance of the decoder in the setting with measurement errors using various noise models. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model. Our work constitutes a step towards finding simple and high-performance decoding strategies for a wide range of quantum low-density parity-check codes.