Alexandru Paler

Alexandru Paler

Auto-generated profile, based on publicly available information

Alexandru Paler

Aalto University

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
14 July 2021 in Nature
Verified
Journal Article
Open access
PDF file
ZCZijun Chen
Zijun Chen
KSKevin J. Satzinger
Kevin J. Satzinger
JAJuan Atalaya
Juan Atalaya
AKAlexander N. Korotkov
Alexander N. Korotkov
ADAndrew Dunsworth
Andrew Dunsworth
JKJulian Kelly
Julian Kelly
Realizing the potential of quantum computing requires sufficiently low logical error rates1. Many applications call for error rates as low as 10−15 (refs. 2–9), but state-of-the-art quantum platforms typically have physical error rates near 10−3 (refs. 10–14). Quantum error correction15–17 promises to bridge this divide by distributing quantum logical information across many physical qubits in such a way that errors can be detected and corrected. Errors on the encoded logical qubit state can be exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold and stable over the course of a computation. Here we implement one-dimensional repetition codes embedded in a two-dimensional grid of superconducting qubits that demonstrate exponential suppression of bit-flip or phase-flip errors, reducing logical error per round more than 100-fold when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analysing error correlations with high precision, allowing us to characterize error locality while performing quantum error correction. Finally, we perform error detection with a small logical qubit using the 2D surface code on the same device18,19 and show that the results from both one- and two-dimensional codes agree with numerical simulations that use a simple depolarizing error model. These experimental demonstrations provide a foundation for building a scalable fault-tolerant quantum computer with superconducting qubits.

24 February 2023 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
APAlexandru Paler
Alexandru Paler
Lucian SasuLucian Sasu
Lucian Sasu
AFAdrian-Cătălin Florea
Adrian-Cătălin Florea
RARazvan Andonie
Razvan Andonie
The quantum circuit layout (QCL) problem involves mapping out a quantum circuit such that the constraints of the device are satisfied. We introduce a quantum circuit mapping heuristic, QXX, and its machine learning version, QXX-MLP. The latter automatically infers the optimal QXX parameter values such that the laid out circuit has a reduced depth. In order to speed up circuit compilation, before laying the circuits out, we use a Gaussian function to estimate the depth of the compiled circuits. This Gaussian also informs the compiler about the circuit region that influences most the resulting circuit’s depth. We present empiric evidence for the feasibility of learning the layout method using approximation. QXX and QXX-MLP open the path to feasible large-scale QCL methods.

22 May 2024 in Quantum
Verified
Journal Article
Open access
PDF file
GWGeorge Watkins
George Watkins
HNHoang Minh Nguyen
Hoang Minh Nguyen
KWKeelan Watkins
Keelan Watkins
SPSteven Pearce
Steven Pearce
HLHoi-Kwan Lau
Hoi-Kwan Lau
APAlexandru Paler
Alexandru Paler
We present the first high performance compiler for very large scale quantum error correction: it translates an arbitrary quantum circuit to surface code operations based on lattice surgery. Our compiler offers an end to end error correction workflow implemented by a pluggable architecture centered around an intermediate representation of lattice surgery instructions. Moreover, the compiler supports customizable circuit layouts, can be used for quantum benchmarking and includes a quantum resource estimator. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device. We compiled within seconds 80 million logical surface code instructions, corresponding to a high precision Clifford+T implementation of the 128-qubit Quantum Fourier Transform (QFT).

8 September 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
APAlexandru Paler
Alexandru Paler
OOOumarou Oumarou
Oumarou Oumarou
Robert BasmadjianRobert Basmadjian
Robert Basmadjian
Quantum algorithms often use quantum random access memory (QRAM) for accessing information stored in a databaselike manner. QRAM has to be fast, resource efficient, and fault tolerant. The latter is often influenced by access speeds, because shorter times introduce less exposure of the stored information to noise. The total execution time of an algorithm depends on the QRAM access time which includes (i) address translation time and (ii) effective query time. The bucket-brigade QRAM was proposed to achieve faster addressing at the cost of exponentially many ancillas. We illustrate a systematic method to significantly reduce the effective query time by using Clifford+T gate parallelism. The method does not introduce any ancilla qubits. Our parallelization method is compatible with the surface code quantum error correction. We show that parallelization is a result of advantageous Toffoli gate decomposition in terms of Clifford+T gates, and after addresses have been translated, we achieve theoretical O(1) parallelism for the effective queries. We conclude that, in theory, (i) fault-tolerant bucket-brigade quantum RAM queries can be performed approximately with the speed of classical RAM, and (ii) the exponentially many ancillas from the bucket-brigade addressing scheme are a tradeoff cost for achieving exponential query speedup compared to quantum read-only memories whose queries are sequential by design. The methods used to compile, parallelize, and analyze the presented QRAM circuits have been implemented in software which is available online.

2 August 2016 in Scientific Reports
Verified
Journal Article
Open access
PDF file
APAlexandru Paler
Alexandru Paler
SDSimon J. Devitt
Simon J. Devitt
AFAustin G. Fowler
Austin G. Fowler
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step towards this goal, focusing on generating correct and simple arrangements of topological structures that correspond to a given quantum circuit and largely neglecting their efficiency. We detail the many challenges that will need to be tackled in the pursuit of efficiency. The software source code can be consulted at https://github.com/alexandrupaler/tqec.

12 February 2024 in Quantum Science and Technology
Verified
Journal Article
Open access
MVMadhav Krishnan Vijayan
Madhav Krishnan Vijayan
APAlexandru Paler
Alexandru Paler
JGJason Gavriel
Jason Gavriel
CMCasey R Myers
Casey R Myers
PRPeter P Rohde
Peter P Rohde
SDSimon J Devitt
Simon J Devitt
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages, such as Cirq and Q#. The computation can then be implemented using a series of non-Pauli measurements on this graph state. By compiling the graph state directly instead of starting with a standard lattice cluster state and preparing it over the course of the computation, we are able to better understand the resource costs involved and eliminate wasteful Pauli measurements on the actual quantum device. Access to this algorithm-specific graph state also allows for optimisation over locally equivalent graph states to implement the same quantum circuit. The compiler presented here finds ready application in measurement based quantum computing, NISQ devices and logical level compilation for fault tolerant implementations.