Browse
Submit Data
Databases
API
Help

Dataset Information

25 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels.

ABSTRACT: Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli gates as the set of twirling gates. This article provides a theoretical background for Pauli twirling and a way to construct a twirling gate set with a number of members comparable to the size of the Pauli basis of the given error channel, which is usually much smaller than the full set of Pauli gates. We also show that twirling is equivalent to stabiliser measurements with discarded measurement results, which enables us to further reduce the size of the twirling gate set.

SUBMITTER: Cai Z

PROVIDER: S-EPMC6677783 | biostudies-literature | 2019 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels.

Cai Zhenyu Z Benjamin Simon C SC

Scientific reports 20190802 1

Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli ...[more]

PMID: 31375710

Similar Datasets

Logical error rate in the Pauli twirling approximation.

Project description:The performance of error correction protocols are necessary for understanding the operation of potential quantum computers, but this requires physical error models that can be simulated efficiently with classical computers. The Gottesmann-Knill theorem guarantees a class of such error models. Of these, one of the simplest is the Pauli twirling approximation (PTA), which is obtained by twirling an arbitrary completely positive error channel over the Pauli basis, resulting in a Pauli channel. In this work, we test the PTA's accuracy at predicting the logical error rate by simulating the 5-qubit code using a 9-qubit circuit with realistic decoherence and unitary gate errors. We find evidence for good agreement with exact simulation, with the PTA overestimating the logical error rate by a factor of 2 to 3. Our results suggest that the PTA is a reliable predictor of the logical error rate, at least for low-distance codes.

| S-EPMC4588586 | biostudies-other

Rapid-SL identifies synthetic lethal sets with an arbitrary cardinality.

Project description:The multidrug resistance of numerous pathogenic microorganisms is a serious challenge that raises global healthcare concerns. Multi-target medications and combinatorial therapeutics are much more effective than single-target drugs due to their synergistic impact on the systematic activities of microorganisms. Designing efficient combinatorial therapeutics can benefit from identification of synthetic lethals (SLs). An SL is a set of non-essential targets (i.e., reactions or genes) that prevent the proliferation of a microorganism when they are "knocked out" simultaneously. To facilitate the identification of SLs, we introduce Rapid-SL, a new multimodal implementation of the Fast-SL method, using the depth-first search algorithm. The advantages of Rapid-SL over Fast-SL include: (a) the enumeration of all SLs that have an arbitrary cardinality, (b) a shorter runtime due to search space reduction, (c) embarrassingly parallel computations, and (d) the targeted identification of SLs. Targeted identification is important because the enumeration of higher order SLs demands the examination of too many reaction sets. Accordingly, we present specific applications of Rapid-SL for the efficient targeted identification of SLs. In particular, we found up to 67% of all quadruple SLs by investigating about 1% of the search space. Furthermore, 307 sextuples, 476 septuples, and over 9000 octuples are found for Escherichia coli genome-scale model, iAF1260.

| S-EPMC9388495 | biostudies-literature

Using cantor sets for error detection.

Project description:Error detection is a fundamental need in most computer networks and communication systems in order to combat the effect of noise. Error detection techniques have also been incorporated with lossless data compression algorithms for transmission across communication networks. In this paper, we propose to incorporate a novel error detection scheme into a Shannon optimal lossless data compression algorithm known as Generalized Luröth Series (GLS) coding. GLS-coding is a generalization of the popular Arithmetic Coding which is an integral part of the JPEG2000 standard for still image compression. GLS-coding encodes the input message as a symbolic sequence on an appropriate 1D chaotic map Generalized Luröth Series (GLS) and the compressed file is obtained as the initial value by iterating backwards on the map. However, in the presence of noise, even small errors in the compressed file leads to catastrophic decoding errors owing to sensitive dependence on initial values, the hallmark of deterministic chaos. In this paper, we first show that repetition codes, the oldest and the most basic error correction and detection codes in literature, actually lie on a Cantor set with a fractal dimension of 1n , which is also the rate of the code. Inspired by this, we incorporate error detection capability to GLS-coding by ensuring that the compressed file (initial value on the chaotic map) lies on a Cantor set. Even a 1-bit error in the initial value will throw it outside the Cantor set, which can be detected while decoding. The rate of the code can be adjusted by the fractal dimension of the Cantor set, thereby controlling the error detection performance.

| S-EPMC7924470 | biostudies-literature

TMA-Mate: An open-source modular toolkit for constructing tissue microarrays of arbitrary layouts.

Project description:Biomedical research and quality control procedures often demand a variety of microscopic analysis of numerous formalin-fixed and paraffin-embedded (FFPE) tissue samples from different individuals of both healthy and diseased regions of interest. Depending on the number of samples to be analyzed, conventional processing of each FFPE block separately can be laborious or impracticable. This effort can be drastically reduced by using tissue microarrays (TMAs). TMAs have a wide range of applications and can be considered as a high-throughput method to process up to hundreds of miniaturized tissue samples simultaneously on a single microscopy slide, in order to reduce labor, costs and sample consumption, and to increase results comparability. Several commercial and self-made solutions to fabricate TMAs with varying degrees of automation are available. However, these solutions may not be suitable for every situation, either due to high costs, high complexity, lack of precision or lack of flexibility, especially when diagnostically oriented pathology institutes or laboratories with constrained resources are considered. This article introduces the TMA-Mate, an open-source 3D printable modular toolkit for constructing high-density TMAs of arbitrary layouts, providing an affordable, lightweight, and accessible procedure to implement TMAs into existing histology processing pipelines. Step-by-step demonstrations for replicating the hardware and constructing TMAs are included.

| S-EPMC10148229 | biostudies-literature

Arbitrary photonic wave plate operations on chip: realizing Hadamard, Pauli-X, and rotation gates for polarisation qubits.

Project description:Chip-based photonic quantum computing is an emerging technology that promises much speedup over conventional computers at small integration volumes. Particular interest is thereby given to polarisation-encoded photonic qubits, and many protocols have been developed for this encoding. However, arbitrary wave plate operation on chip are not available so far, preventing from the implementation of integrated universal quantum computing algorithms. In our work we close this gap and present Hadamard, Pauli-X, and rotation gates of high fidelity for photonic polarisation qubits on chip by employing a reorientation of the optical axis of birefringent waveguides. The optical axis of the birefringent waveguide is rotated due to the impact of an artificial stress field created by an additional modification close to the waveguide. By adjusting this length of the defect along the waveguide, the retardation between ordinary and extraordinary field components is precisely tunable including half-wave plate and quarter-wave plate operations. Our approach demonstrates the full range control of orientation and strength of the induced birefringence and thus allows arbitrary wave plate operations without affecting the degree of polarisation or introducing additional losses to the waveguides. The implemented gates are tested with classical and quantum light.

| S-EPMC3927208 | biostudies-other

Constructing ion channels from water-soluble α-helical barrels.

Project description:The design of peptides that assemble in membranes to form functional ion channels is challenging. Specifically, hydrophobic interactions must be designed between the peptides and at the peptide-lipid interfaces simultaneously. Here, we take a multi-step approach towards this problem. First, we use rational de novo design to generate water-soluble α-helical barrels with polar interiors, and confirm their structures using high-resolution X-ray crystallography. These α-helical barrels have water-filled lumens like those of transmembrane channels. Next, we modify the sequences to facilitate their insertion into lipid bilayers. Single-channel electrical recordings and fluorescent imaging of the peptides in membranes show monodisperse, cation-selective channels of unitary conductance. Surprisingly, however, an X-ray structure solved from the lipidic cubic phase for one peptide reveals an alternative state with tightly packed helices and a constricted channel. To reconcile these observations, we perform computational analyses to compare the properties of possible different states of the peptide.

| S-EPMC7611114 | biostudies-literature

CLGBO: An Algorithm for Constructing Highly Robust Coding Sets for DNA Storage.

Project description:In the era of big data, new storage media are urgently needed because the storage capacity for global data cannot meet the exponential growth of information. Deoxyribonucleic acid (DNA) storage, where primer and address sequences play a crucial role, is one of the most promising storage media because of its high density, large capacity and durability. In this study, we describe an enhanced gradient-based optimizer that includes the Cauchy and Levy mutation strategy (CLGBO) to construct DNA coding sets, which are used as primer and address libraries. Our experimental results show that the lower bounds of DNA storage coding sets obtained using the CLGBO algorithm are increased by 4.3-13.5% compared with previous work. The non-adjacent subsequence constraint was introduced to reduce the error rate in the storage process. This helps to resolve the problem that arises when consecutive repetitive subsequences in the sequence cause errors in DNA storage. We made use of the CLGBO algorithm and the non-adjacent subsequence constraint to construct larger and more highly robust coding sets.

| S-EPMC8129200 | biostudies-literature

Ovarian Follicle: Twirling Microfilaria's New Abode.

Project description: Not available

| S-EPMC7109222 | biostudies-literature

Constructing 3-Dimensional Atomic-Resolution Models of Nonsulfated Glycosaminoglycans with Arbitrary Lengths Using Conformations from Molecular Dynamics.

Project description:Glycosaminoglycans (GAGs) are the linear carbohydrate components of proteoglycans (PGs) and are key mediators in the bioactivity of PGs in animal tissue. GAGs are heterogeneous, conformationally complex, and polydisperse, containing up to 200 monosaccharide units. These complexities make studying GAG conformation a challenge for existing experimental and computational methods. We previously described an algorithm we developed that applies conformational parameters (i.e., all bond lengths, bond angles, and dihedral angles) from molecular dynamics (MD) simulations of nonsulfated chondroitin GAG 20-mers to construct 3-D atomic-resolution models of nonsulfated chondroitin GAGs of arbitrary length. In the current study, we applied our algorithm to other GAGs, including hyaluronan and nonsulfated forms of dermatan, keratan, and heparan and expanded our database of MD-generated GAG conformations. Here, we show that individual glycosidic linkages and monosaccharide rings in 10- and 20-mers of hyaluronan and nonsulfated dermatan, keratan, and heparan behave randomly and independently in MD simulation and, therefore, using a database of MD-generated 20-mer conformations, that our algorithm can construct conformational ensembles of 10- and 20-mers of various GAG types that accurately represent the backbone flexibility seen in MD simulations. Furthermore, our algorithm efficiently constructs conformational ensembles of GAG 200-mers that we would reasonably expect from MD simulations.

| S-EPMC7589010 | biostudies-literature

Constructing a new prognostic signature of gastric cancer based on multiple data sets.

Project description:In order to explore new prediction methods and key genes for gastric cancer. Firstly, we downloaded the 6 original sequencing data of gastric cancer on the Illumina HumanHT-12 platform from Array Expression and Gene Expression Omnibus, and used bioinformatics methods to identify 109 up-regulated genes and 271 down-regulated genes. Further, we performed univariate Cox regression analysis of prognostic-related genes, then used Lasso regression to remove collinearity, and finally used multivariate Cox regression to analyze independent prognostic genes (MT1M, AKR1C2, HEYL, KLK11, EEF1A2, MMP7, THBS1, KRT17, RPESP, CMTM4, UGT2B17, CGNL1, TNFRSF17, REG1A). Based on these, we constructed a prognostic risk proportion signature, and found that patients with high-risk gastric cancer have a high degree of malignancy. Subsequently, we used the GSE15459 data set to verify the signature. By calculating the area under the recipient operator characteristic curve of 5-year survival rate, the test set and verification set are 0.739 and 0.681, respectively, suggesting that the prognostic signature has a moderate prognostic ability. The nomogram is used to visualize the prognostic sig-nature, and the calibration curve verification showed that the prediction accuracy is higher. Finally, we verified the expression and prognosis of the hub gene, and suggested that HEYL, MMP7, THBS1, and KRT17 may be potential prognostic biomarkers.

| S-EPMC8806649 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data