Matthew Steinberg
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthew Steinberg has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Sebastian Feld
Delft University of Technology
6 shared publications Aritra Sarkar
Quantum Computing Division, QuTech, Delft University of Technology, Delft, the Netherlands
2 shared publicationsCarmen G. Almudever
Computer Engineering Department, Technical University of Valencia, València, Spain
2 shared publications- David Elkouss
Okinawa Institute of Science and Technology
2 shared publications Javier Prior
Departamento de Física Aplicada, Universidad Politécnica de Cartagena, Cartagena, Spain
2 shared publicationsMedina Bandić
Quantum Computing Division, QuTech, Delft University of Technology, Delft, the Netherlands
2 shared publications
Latest Publications
- Open Access
- 8 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1826
Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic geometry with even , yielding an infinitely large class of subsystem codes. We construct an example for a manifold and describe strategies of logical gauge fixing that lead to different rates and distances , which we calculate analytically, finding distances which range from to . Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with , finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.- 8 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1826
Open AccessFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic geometry with even , yielding an infinitely large class of subsystem codes. We construct an example for a manifold and describe strategies of logical gauge fixing that lead to different rates and distances , which we calculate analytically, finding distances which range from to . Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with , finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications. - Open Access
- 9 April 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (2)
Near-Term Spin-Qubit Architecture Design via Multipartite Maximally Entangled States
The design and benchmarking of quantum computer architectures traditionally rely on practical hardware restrictions, such as gate fidelities, control, and cooling. At the theoretical and software levels, numerous approaches have been proposed for benchmarking quantum devices, ranging from, , quantum volume to randomized benchmarking. In this work, we utilize the quantum information-theoretic properties of multipartite maximally entangled quantum states, in addition to their correspondence with quantum error-correction codes, permitting us to quantify the entanglement generated on near-term bilinear spin-qubit architectures. For this aim, we introduce four metrics that ascertain the quality of genuine multipartite quantum entanglement, along with circuit-level fidelity measures. As part of the task of executing a quantum circuit on a device, we devise simulations, which combine expected hardware characteristics of spin-qubit devices with appropriate compilation techniques; we then analyze three different architectural choices of varying lattice sizes for bilinear arrays, under three increasingly realistic noise models. We find that if the use of a compiler is assumed, sparsely connected spin-qubit lattices can approach comparable values of our metrics to those of the most highly connected device architecture. Even more surprisingly, by incorporating crosstalk into our last noise model, we find that, as error rates for crosstalk approach realistic values, the benefits of utilizing a bilinear array with advanced connectivity vanish. Our results highlight the limitations of adding local connectivity to near-term spin-qubit devices, and can be readily adapted to other qubit technologies. The framework developed here can be used for analyzing quantum entanglement on a device before fabrication, informing experimentalists on concomitant realistic expectations.
- 9 April 2025
- Published by American Physical Society (APS) in PRX Quantum
- Vol. 6 (2)
Open AccessNear-Term Spin-Qubit Architecture Design via Multipartite Maximally Entangled States
The design and benchmarking of quantum computer architectures traditionally rely on practical hardware restrictions, such as gate fidelities, control, and cooling. At the theoretical and software levels, numerous approaches have been proposed for benchmarking quantum devices, ranging from, , quantum volume to randomized benchmarking. In this work, we utilize the quantum information-theoretic properties of multipartite maximally entangled quantum states, in addition to their correspondence with quantum error-correction codes, permitting us to quantify the entanglement generated on near-term bilinear spin-qubit architectures. For this aim, we introduce four metrics that ascertain the quality of genuine multipartite quantum entanglement, along with circuit-level fidelity measures. As part of the task of executing a quantum circuit on a device, we devise simulations, which combine expected hardware characteristics of spin-qubit devices with appropriate compilation techniques; we then analyze three different architectural choices of varying lattice sizes for bilinear arrays, under three increasingly realistic noise models. We find that if the use of a compiler is assumed, sparsely connected spin-qubit lattices can approach comparable values of our metrics to those of the most highly connected device architecture. Even more surprisingly, by incorporating crosstalk into our last noise model, we find that, as error rates for crosstalk approach realistic values, the benefits of utilizing a bilinear array with advanced connectivity vanish. Our results highlight the limitations of adding local connectivity to near-term spin-qubit devices, and can be readily adapted to other qubit technologies. The framework developed here can be used for analyzing quantum entanglement on a device before fabrication, informing experimentalists on concomitant realistic expectations.
- Open Access
- 16 December 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1
Author Correction: Lightcone bounds for quantum circuit mapping via uncomplexity
- 16 December 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1
Open AccessAuthor Correction: Lightcone bounds for quantum circuit mapping via uncomplexity
- Open Access
- 9 November 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-13
Lightcone bounds for quantum circuit mapping via uncomplexity
- 9 November 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-13
Open AccessLightcone bounds for quantum circuit mapping via uncomplexity
- Open Access
Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes
Flag-style fault-tolerance has become a linchpin in the realization of small fault-tolerant quantum-error correction experiments. The flag protocol's utility hinges on low qubit overhead, which is typically much smaller than in other approaches. However, as in most fault-tolerance protocols, the advantages of flag-style error correction come with a tradeoff: fault tolerance can be guaranteed, but such protocols involve high-depth circuits, due to the need for repeated stabilizer measurements. Here, we demonstrate that a dynamic choice of stabilizer measurements, based on past syndromes, and the utilization of elements from the full stabilizer group, leads to flag protocols with lower-depth syndrome-extraction circuits for the [[5,1,3]] code, as well as for the Steane code when compared to the standard methods in flag fault tolerance. We methodically prove that our new protocols yield fault-tolerant lookup tables, and demonstrate them with a pseudothreshold simulation, showcasing large improvements for all protocols when compared to previously-established methods. This work opens the dialogue on exploiting the properties of the full stabilizer group for reducing circuit overhead in fault-tolerant quantum-error correction.
Open AccessLow-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes
Flag-style fault-tolerance has become a linchpin in the realization of small fault-tolerant quantum-error correction experiments. The flag protocol's utility hinges on low qubit overhead, which is typically much smaller than in other approaches. However, as in most fault-tolerance protocols, the advantages of flag-style error correction come with a tradeoff: fault tolerance can be guaranteed, but such protocols involve high-depth circuits, due to the need for repeated stabilizer measurements. Here, we demonstrate that a dynamic choice of stabilizer measurements, based on past syndromes, and the utilization of elements from the full stabilizer group, leads to flag protocols with lower-depth syndrome-extraction circuits for the [[5,1,3]] code, as well as for the Steane code when compared to the standard methods in flag fault tolerance. We methodically prove that our new protocols yield fault-tolerant lookup tables, and demonstrate them with a pseudothreshold simulation, showcasing large improvements for all protocols when compared to previously-established methods. This work opens the dialogue on exploiting the properties of the full stabilizer group for reducing circuit overhead in fault-tolerant quantum-error correction.
- Open Access
- 16 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 3, 1-14
Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto a NISQ device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on a NISQ device, but does not route qubits during the quantum algorithm's execution) is presented and compared against the optimal brute-force solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm's performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms which admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work thus characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm which one may wish to run on a given NISQ device.
- 16 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 3, 1-14
Open AccessTopological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto a NISQ device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on a NISQ device, but does not route qubits during the quantum algorithm's execution) is presented and compared against the optimal brute-force solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm's performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms which admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work thus characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm which one may wish to run on a given NISQ device.
- Open Access
- 11 January 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-16
Conformal properties of hyperinvariant tensor networks
Hyperinvariant tensor networks (hyMERA) were introduced as a way to combine the successes of perfect tensor networks (HaPPY) and the multiscale entanglement renormalization ansatz (MERA) in simulations of the AdS/CFT correspondence. Although this new class of tensor network shows much potential for simulating conformal field theories arising from hyperbolic bulk manifolds with quasiperiodic boundaries, many issues are unresolved. In this manuscript we analyze the challenges related to optimizing tensors in a hyMERA with respect to some quasiperiodic critical spin chain, and compare with standard approaches in MERA. Additionally, we show two new sets of tensor decompositions which exhibit different properties from the original construction, implying that the multitensor constraints are neither unique, nor difficult to find, and that a generalization of the analytical tensor forms used up until now may exist. Lastly, we perform randomized trials using a descending superoperator with several of the investigated tensor decompositions, and find that the constraints imposed on the spectra of local descending superoperators in hyMERA are compatible with the operator spectra of several minimial model CFTs.
- 11 January 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-16
Open AccessConformal properties of hyperinvariant tensor networks
Hyperinvariant tensor networks (hyMERA) were introduced as a way to combine the successes of perfect tensor networks (HaPPY) and the multiscale entanglement renormalization ansatz (MERA) in simulations of the AdS/CFT correspondence. Although this new class of tensor network shows much potential for simulating conformal field theories arising from hyperbolic bulk manifolds with quasiperiodic boundaries, many issues are unresolved. In this manuscript we analyze the challenges related to optimizing tensors in a hyMERA with respect to some quasiperiodic critical spin chain, and compare with standard approaches in MERA. Additionally, we show two new sets of tensor decompositions which exhibit different properties from the original construction, implying that the multitensor constraints are neither unique, nor difficult to find, and that a generalization of the analytical tensor forms used up until now may exist. Lastly, we perform randomized trials using a descending superoperator with several of the investigated tensor decompositions, and find that the constraints imposed on the spectra of local descending superoperators in hyMERA are compatible with the operator spectra of several minimial model CFTs.
- Open Access
- 29 July 2021
- Published by Springer Nature in Research Square
Conformal Properties of Hyperinvariant Tensor Networks
Hyperinvariant tensor networks (hyMERA) were introduced as a way to combine the successes of perfect tensor networks (HaPPY) and the multiscale entanglement renormalization ansatz (MERA) in simulations of the AdS/CFT correspondence. Although this new class of network shows much potential for simulating conformal field theories on hyperbolic bulk manifolds with quasiperiodic boundaries, many issues must still be solved. In this manuscript we analyze the challenges related to optimizing tensors in a hyMERA with respect to some critical spin chain, and compare with standard approaches in MERA. Additionally, we show two new sets of tensor decompositions which exhibit different properties from the original construction, and imply that the multitensor constraints are more general than previously suggested. Lastly, we provide numerical evidence that the constraints imposed on the spectra of local descending superoperators in hyMERA are compatible with the operator spectra for many minimial model CFTs.
- 29 July 2021
- Published by Springer Nature in Research Square
Open AccessConformal Properties of Hyperinvariant Tensor Networks
Hyperinvariant tensor networks (hyMERA) were introduced as a way to combine the successes of perfect tensor networks (HaPPY) and the multiscale entanglement renormalization ansatz (MERA) in simulations of the AdS/CFT correspondence. Although this new class of network shows much potential for simulating conformal field theories on hyperbolic bulk manifolds with quasiperiodic boundaries, many issues must still be solved. In this manuscript we analyze the challenges related to optimizing tensors in a hyMERA with respect to some critical spin chain, and compare with standard approaches in MERA. Additionally, we show two new sets of tensor decompositions which exhibit different properties from the original construction, and imply that the multitensor constraints are more general than previously suggested. Lastly, we provide numerical evidence that the constraints imposed on the spectra of local descending superoperators in hyMERA are compatible with the operator spectra for many minimial model CFTs.
- 1 April 2019
- Published by Elsevier in Economics of Education Review
- Vol. 69, 25-60
The effects of closing urban schools on students’ academic and behavioral outcomes: Evidence from Philadelphia
- 1 April 2019
- Published by Elsevier in Economics of Education Review
- Vol. 69, 25-60
The effects of closing urban schools on students’ academic and behavioral outcomes: Evidence from Philadelphia