Search NASA⌕ Search

SEARCH · Search NASA

Results for “error correction”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Author Correction: Genome-guided isolation of the hyperthermophilic aerobe Fervidibacter sacchari reveals conserved polysaccharide metabolism in the Armatimonadota

Correction to: Nature Communicationshttps://doi.org/10.1038/s41467-024-53784-3, published online 4 November 2024 In the version of this article initially published, Table 1 did not include the properties of the taxa being proposed or refer directly to another location in the main manuscript describing the properties. As such, the original manuscript did not comply with Rule 27 (2)(c) of the ICNP. Also, Table 1 listed the order Fervidibacterales as the nomenclatural type for the class Fervidibacteria, which violates latest emended version of Rule 15 stating that the nomenclatural type for a class must be a genus. Below we provide a modification of Table 1 containing protologues with these errors corrected. We have also changed the order of the taxa in the table to meet the most common ordering. (Table presented.) Taxon names proposed under the ICNP Proposed taxon Etymology Description Genus Fervidibacter Fer.vi.di.bac’ter. L. masc. adj. fervidus, hot, steaming; N.L. masc. n. bacter, a rod; N.L. masc. n. Fervidibacter, a hot rod Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic, with high-affinity and/or low-affinity terminal oxidases present in the genomes. The oxidative pentose phosphate pathway and the tricarboxylic acid cycle are complete in genomes belonging to the genus. Gram-stain-negative and diderm cell envelope structure. Ovoid- to rod-shaped morphology. Spores are not formed. The genus is a distinct phylogenetic lineage in the family Fervidibacteraceae, the order Fervidibacterales, and the class Fervidibacteria in the phylum Armatimonadota. The type species is Fervidibacter sacchariT. Species Fervidibacter sacchari sac’cha.ri. N.L. gen. n. sacchari, of sugar Hyperthermophilic, microaerophilic, facultatively anaerobic, and grows chemoheterotrophically on monosaccharides and polysaccharides. Cells are ovoid- to rod-shaped, Gram-stain negative, and are 0.9–1.3 µm in width and 1.6–3.6 µm in length. Grows between 65 and 87.5 °C and an optimum temperature of 80 °C, and a pH range of 6.5–8.6 with an optimum pH of 7.5. Grows at an optimum O2 concentration of 5–10%. Grows on D-arabinose, D-galactose, D-glucose, D-rhamnose, D-ribose, D-xylose, chondroitin sulfate, colloidal chitin, galactan, gellan gum, guar gum, karaya gum, locust bean gum, xantham gum, xyloglucan, β-glucan, glycogen, starch, AFEX-pretreated corn stover, miscanthus, sugarcane bagasse, acetate and casamino acids. Grows weakly on xyloglucan under fermentation conditions. The major fatty acids (>10%) are C16:0, C18:0 and/or cyclo-C17:0, and iso-C16:0. The major respiratory quinones (>10%) are MK-8 and MK-9. The isolate and genomes of the species have been recovered from geothermal springs in the Great Basin, Nevada, USA. GC content of genomes range between 51–52%. Subunits for both the high-affinity and low-affinity terminal oxidases are encoded in the genomes. Genomes also encode a Group 3d [NiFe] hydrogenase, which produces hydrogen as an electron sink for NAD+ regeneration. The type strain PD1T (= JCM 39283T = DSM 113467T) was isolated from Great Boiling Spring in Nevada, USA. Family Fervidibacteraceae Fer.vi.di.bac.te.ra’ce.ae. N.L. masc. n. Fervidibacter type genus of the family; L. suff. -aceae ending to denote a family; N.L. fem. pl. n. Fervidibacteraceae the family of the genus Fervidibacter Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic, with high-affinity and/or low-affinity terminal oxidases present in the genomes. The oxidative pentose phosphate pathway and the tricarboxylic acid cycle are complete in genomes belonging to the family. The family is a distinct phylogenetic lineage in the order Fervidibacterales and the class Fervidibacteria in the phylum Armatimonadota. The type genus is Fervidibacter. Order Fervidibacterales Fer.vi.di.bac.te.ra’les. N.L. masc. n. Fervidibacter type genus of the order; L. suff. -ales ending to denote an order; N.L. fem. pl. n. Fervidibacterales the order of the genus Fervidibacter Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic or strictly anaerobic. Phylogenomic placement of this lineage within the Fervidibacteria and relative evolutionary divergence supports delineation of this lineage as an order within the class Fervidibacteria and phylum Armatimonadota. The type genus is Fervidibacter. Class Fervidibacteria Fer.vi.di.bac.te’ri.a. N.L. masc. n. Fervidibacter type genus of the type order of the class; L. suff. -ia ending to denote a class; N.L. neut. pl. n. Fervidibacteria the class of the order Fervidibacterales Thermophilic or hyperthermophilic inhabitants of freshwater thermal environments. All members are likely polysaccharide-degrading chemoheterotrophs with numerous carbohydrate-active enzymes encoded in their genomes. Aerobic or strictly anaerobic. Phylogenomic placement of this lineage within the Armatimonadota and relative evolutionary divergence supports delineation of this lineage as a class within the Armatimonadota. The type genus is Fervidibacter. The error has not been corrected in the PDF or HTML versions of the Article.

Nou, Nancy O↗

ORBIT CORRECTION STUDIES ON THE ELECTRON TRANSPORT LINE FROM RCS TO ESR

A dedicated electron transfer line from Rapid Cycling Synchrotron (RCS) to Electron Storage Ring (ESR), referred to as the RTE line has been designed for the Electron-Ion Collider (EIC). The beamline follows a straight-line geometry, with a length of 133 m, and is consists with two matching sections and a FODO section for beam diagnostics. Imperfections with magnet alignments introduce orbit distortions, making orbit correction scheme a critical component in the design. To facilitate orbit correction, each quadrupole magnet is equipped with a pair of beam position monitors (BPMs) and kickers. The Singular Value Decomposition (SVD) algorithm is used for orbit correction and tolerance studies. This paper presents the ongoing progress in the optics design and error correction scheme of the RTE line.

Neththikumara, I. [Thomas Jefferson National Accel↗

Modeling phonon-mediated quasiparticle poisoning in superconducting qubit arrays

Correlated errors caused by ionizing radiation impacting superconducting qubit chips are problematic for quantum error correction. Such impacts generate quasiparticle (QP) excitations in the qubit electrodes, which temporarily reduce qubit coherence significantly. The many energetic phonons produced by a particle impact travel efficiently throughout the device substrate and generate quasiparticles with high probability, thus causing errors on a large fraction of the qubits in an array simultaneously. Here, we describe a comprehensive strategy for the numerical simulation of the phonon and quasiparticle dynamics in the aftermath of an impact. We compare the simulations with experimental measurements of phonon-mediated QP poisoning and demonstrate that our modeling captures the spatial and temporal footprint of the QP poisoning for various configurations of phonon downconversion structures. We thus present a path forward for the operation of superconducting quantum processors in the presence of ionizing radiation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Measuring error rates of mid-circuit measurements

High-fidelity mid-circuit measurements, which read out the state of specific qubits in a multiqubit processor without destroying them or disrupting their neighbors, are a critical component for useful quantum computing. They enable fault-tolerant quantum error correction, dynamic circuits, and other paths to solving classically intractable problems. But there are few methods to assess their performance comprehensively. In this work, we address this gap by introducing the first randomized benchmarking protocol that measures the rate at which mid-circuit measurements induce errors in many-qubit circuits. Using this protocol, we detect and eliminate previously undetected measurement-induced crosstalk in a 20-qubit trapped-ion quantum computer. Then, we use the same protocol to measure the rate of measurement-induced crosstalk error on a 27-qubit IBM Q processor, and quantify how much of that error is eliminated by dynamical decoupling.

Hothem, Daniel [Sandia National Laboratories (SNL-↗

Impact of dynamics, entanglement and Markovian noise on the fidelity of few-qubit digital quantum simulation

Quantum algorithms have been proposed to accelerate the simulation of the chaotic dynamical systems that are ubiquitous in the physics of plasmas. Quantum computers without error correction might even use noise to their advantage to calculate the Lyapunov exponent by measuring the Loschmidt echo fidelity decay rate. For the first time, digital Hamiltonian simulations of the quantum sawtooth map, performed on the IBM-Q quantum hardware platform, show that the fidelity decay rate of a digital quantum simulation increases during the transition from dynamical localization to chaotic diffusion in the map. The observed error per CNOT gate increases by $1.5{\times }$ as the dynamics varies from localized to diffusive, while only changing the phases of virtual RZ gates and keeping the overall gate count constant. A gate-based Lindblad noise model that captures the effective change in relaxation and dephasing errors during gate operation qualitatively explains the effect of dynamics on fidelity as being due to the localization and entanglement of the states created. Specifically, highly delocalized states that are entangled with random phases show an increased sensitivity to dephasing and, on average, a similar sensitivity to relaxation as localized states. In contrast, delocalized unentangled states show an increased sensitivity to dephasing but a lower sensitivity to relaxation. This gate-based Lindblad model is shown to be a useful benchmarking tool by estimating the effective Lindblad coherence times during CNOT gates and finding a consistent $2\unicode{x2013}3{\times }$ shorter $T_2$ time than reported for idle qubits. Thus, the interplay of the dynamics of a simulation with the noise processes that are active can strongly influence the overall fidelity decay rate.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Resilient State Recovery Using Prior Measurement Support Information

Resilient state recovery of cyber-physical systems has attracted much research attention due to the unique challenges posed by the tight coupling between communication, computation, and the underlying physics of such systems. By modeling attacks as additive adversary signals to a sparse subset of measurements, this resilient recovery problem can be formulated as an error correction problem. To achieve exact state recovery, most existing results require less than 50% of the measurement nodes to be compromised, which limits the resiliency of the estimators. In this paper, we show that observer resiliency can be further improved by incorporating data-driven prior information. Here, we provide an analytical bridge between the precision of prior information and the resiliency of the estimator. By quantifying the relationship between the estimation error of the weighted ℓ 1 observer and the precision of the support prior, this quantified relationship provides guidance for the estimator’s weight design to achieve optimal resiliency. Several numerical simulations and an application case study are presented to validate the theoretical claims.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

Toward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes

Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes that affects code performance and ease of physical realization. For device architectures restricted to two-dimensional (2D) local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error-correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate-bicycle qLDPC codes and show that they are well suited for a parallel syndrome-measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes, bivariate-bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits. Published by the American Physical Society 2025

Berthusen, Noah (ORCID:0000000275862786)↗

Q-Cluster: Quantum Error Mitigation Through Noise-Aware Unsupervised Learning

Quantum error mitigation (QEM) is critical in reducing the impact of noise in the pre-fault-tolerant era, and is expected to complement error correction in fault-tolerant quantum computing (FTQC). In this work, we propose a novel QEM approach, Q-Cluster, that uses unsupervised learning (clustering) to reshape the measured bit-string distribution. Our approach starts with a simplified bit-flip noise model. It first performs clustering on noisy measurement results, i.e., bit-strings, based on the Hamming distance. The centroid of each cluster is calculated using a qubit-wise majority vote. Next, the noisy distribution is adjusted with the clustering outcomes and the bitflip error rates using Bayesian inference. Our simulation results show that Q-Cluster can mitigate high noise rates (up to 40% per qubit) with the simple bit-flip noise model. However, real quantum computers do not fit such a simple noise model. To address the problem, we (a) apply Pauli twirling to tailor the complex noise channels to Pauli errors, and (b) employ a machine learning model, ExtraTrees regressor, to estimate an effective bit-flip error rate using a feature vector consisting of machine calibration data (gate & measurement error rates), circuit features (number of qubits, numbers of different types of gates, etc.) and the shape of the noisy distribution (entropy). Our experimental results show that our proposed Q-Cluster scheme improves the fidelity by a factor of 1.46x, on average, compared to the unmitigated output distribution, for a set of low-entropy benchmarks on five different IBM quantum machines. Our approach outperforms the state-of-art QEM approaches RZNE [28], M3 [24], Hammer [35], and QBEEP [33] by 1.26x,1.29x,1.47x, and 2.65 x, respectively.

42 ENGINEERING↗

Rapid Commissioning of Large Machine Tools Using Finite Element-Based Correction of Geometric Errors

Large computer numerical control (CNC) machine tools derive their stiffness from monolithic cast iron bases or weldments that are sometimes integral to machine motion systems like box ways or guideways. However, the sheer size of castings and even floor flatness deviations result in dimensional errors in these systems, which manifest as machine motion errors. Typical geometric alignment processes rely on an iterative approach, where measurements are taken to assess alignment (straightness, squareness, and parallelism), followed by adjustment of the machine supports (fixators or leveling pads), which can take weeks even for an experienced operator. Conversely, a novel method is proposed to shorten the correction time by eliminating the trial-and-error process in favor of a more deterministic approach guided by a finite element (FE) method. A feasibility study is conducted on a CNC polymer hybrid machine, with a steel weldment frame, supported by six leveling pads. An FE model of the frame is utilized to obtain recommended leveling pad adjustments, based on measurement of machine errors taken using a laser tracker. After a single adjustment cycle, measurements reveal that geometric errors of the machine tool are reduced from 2.22 mm of flatness deviation to 0.32 mm, achieving an 85.6% reduction. Furthermore, the entire process including measurement, adjustment, and assessment is completed in just 6 h by two operators who are not professional service engineers. In conclusion, this methodology demonstrates feasibility for scaling up, especially to large, high-precision CNC machine tools with bases mounted by fixators, offering the capability for bidirectional adjustment.

42 ENGINEERING↗

Multitarget Rydberg gates via spatial blockade engineering

Multi-target gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction. Although neutral-atom quantum computers have demonstrated native multi-qubit gates, existing approaches that avoid additional control or multiple atomic species have been limited to single-target gates. We propose single-control-multi-target CZ^n gates on a single-species neutral-atom platform that require no extra control and have gate durations comparable to standard CZ gates. Our approach leverages tailored interatomic distances to create an asymmetric blockade between the control and target atoms. Using a GPU-accelerated pulse synthesis protocol, we design smooth control pulses for CZZ and CZZZ gates, achieving fidelities of up to 99.55% and $99.24\%$, respectively, even in the presence of simulated atom placement errors and Rydberg-state decay. Our approach is most effective for N=2 (CZZ) and N=3 targets (CZZZ); for larger N, increasing spatial crowding of the targets introduces significant challenges for maintaining the required blockade asymmetry. This work presents a practical path to implementing low-overhead multi-target gates in single-species neutral-atom systems, significantly reducing the resource overhead for syndrome extraction. To motivate the impact of these gates, we apply a greedy scheduling algorithm and we demonstrate that our proposed gates can reduce the number of atom reconfiguration costs by up to 50% for color code syndrome extraction of code distances greater than 5.

Stein, Samuel A.↗

Noisy quantum trees: infinite protection without correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by the delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d ≥ 2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encodes the received qubit in the binary repetition code with distance d = 1.

Quantum information↗

A cryogenic muon tagging system based on kinetic inductance detectors for superconducting quantum processors

Ionizing radiation has emerged as a potential limiting factor for superconducting quantum processors, inducing quasiparticle bursts and correlated errors that challenge fault-tolerant operation. Atmospheric muons are particularly problematic due to their high energy and penetration power, making passive shielding ineffective. Therefore, monitoring the real-time muon flux is crucial to guide the development of alternative error-correction or mitigation strategies. We present the design, simulation, and first operation of a cryogenic muon-tagging system based on kinetic inductance detectors (KIDs), developed as a stand-alone cryogenic particle-tagging module for superconducting quantum processors. The system consists of two KIDs arranged in a vertical stack and operated at ∼20 mK. Monte Carlo simulations based on Geant4 guided the prototype design and provided reference expectations for muon-tagging efficiency and accidental coincidences due to ambient γ-rays. We observed a muon-induced coincidence rate among the top and bottom detectors of (192 ± 9) $\times\,10^{-3}$ events s$^{−1}$, in excellent agreement with the Monte Carlo prediction. The prototype achieves a muon-tagging efficiency of about 90% with negligible dead time. These results demonstrate the feasibility of operating a muon-tagging system at millikelvin temperatures and represent a key step toward the integration of cryogenic veto systems with multi-qubit chips to mitigate muon-induced errors.

Mariani, Ambra [INFN, Rome] (ORCID:000000028184857↗

Relational bulk reconstruction from modular flow

Abstract The entanglement wedge reconstruction paradigm in AdS/CFT states that for a bulk qudit within the entanglement wedge of a boundary subregion$$ \overline{A} $$ A ¯ , operators acting on the bulk qudit can be reconstructed as CFT operators on$$ \overline{A} $$ A ¯ . This naturally fits within the framework of quantum error correction, with the CFT states containing the bulk qudit forming a code protected against the erasure of the boundary subregionA. In this paper, we set up and study a framework for relational bulk reconstruction in holography: given two code subspaces both protected against erasure of the boundary regionA, the goal is to relate the operator reconstructions between the two spaces. To accomplish this, we assume that the two code subspaces are smoothly connected by a one-parameter family of codes all protected against the erasure ofA, and that the maximally-entangled states on these codes are all full-rank. We argue that such code subspaces can naturally be constructed in holography in a “measurement-based” setting. In this setting, we derive a flow equation for the operator reconstruction of a fixed code subspace operator using modular theory which can, in principle, be integrated to relate the reconstructed operators all along the flow. We observe a striking resemblance between our formulas for relational bulk reconstruction and the infinite-time limit of Connes cocycle flow, and take some steps towards making this connection more rigorous. We also provide alternative derivations of our reconstruction formulas in terms of a canonical reconstruction map we call the modular reflection operator.

Physics↗

Security of quantum position-verification limits Hamiltonian simulation via holography

We investigate the link between quantum position-verification (QPV) and holography established in [1] using holographic quantum error correcting codes as toy models. By inserting the “temporal” scaling of the AdS metric by hand via the bulk Hamiltonian interaction strength, we recover a toy model with consistent causality structure. This leads to an interesting implication between two topics in quantum information: if position-based verification is secure against attacks with small entanglement then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.

AdS-CFT Correspondence↗

Changes to virus taxonomy, the international code of virus classification and nomenclature, and the ICTV statutes ratified by the International Committee on Taxonomy of Viruses (2025)

Abstract The 56th meeting of the Executive Committee (EC) of the International Committee on Taxonomy of Viruses (ICTV) was held in Bari, Italy, in July/August, 2024, and 115 submitted taxonomy proposals were reviewed. A total of 112 were subsequently ratified by the ICTV membership. An additional 9 error correction proposals were also approved in August 2025. This article lists the taxonomy proposals that have now been incorporated into release 40 version v2 of the Master Species List ( https://ictv.global/msl ), the Virus Metadata Resource ( https://ictv.global/vmr ), and associated ICTV databases. In addition to the assignments of 1,563 new virus species, 243genera, 55 families, 11 orders, and 8 classes, there were substantial additions to higher taxonomic ranks. These include the creation of a new realm ( Singelaviria ), which is based on the recognition of a separate evolutionary origin for the hallmark capsid genes of members of the kingdom Helvetiavirae. These express capsid proteins forming a single jelly-roll fold that is structurally and evolutionarily distinct from those of members of the family Bamfordvirae , assigned to the realm Varidnaviria . Furthermore, the realm Varidnaviria underwent a major reorganization, including the addition of a new kingdom, Abadenavirae . Another notable change was the classification of the vertebrate-infecting single-stranded DNA anellovirids into a new phylum Commensaviricota (kingdom Shotokuvirae , realm Monodnaviria ). Archaeal viruses infecting the hyperthermophilic Archaeoglobi were assigned to a new phylum Calorviricota , in the kingdom Trapavirae (realm Monodnaviria ), whereas RNA viruses infecting hyperthermophilic bacteria were classified into a new phylum Artimaviricota (realm Riboviria ). In recognition of his extensive and valuable contributions to virus taxonomic developments in Study Groups and over the period of his EC membership, Stuart Siddell was honoured as a new life member of the ICTV. The ICTV has created a new strategy for disseminating information on taxonomy advances through annual open-access publication of citeable taxonomy proposal summaries from each ICTV Subcommittee. A collective total of 354 co-authors of the seven summaries were drawn from members of each Subcommittee, the EC, and a very large number of contributors from the wider virology community.

Simmonds, Peter (ORCID:0000000279644700)↗