Quantum field lens coding and classification algorithm to predict measurement outcomes
Ontology highlight
ABSTRACT:
SUBMITTER: Alipour P
PROVIDER: S-EPMC10114244 | biostudies-literature | 2023 Jan
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Quantum field lens coding algorithm (QF-LCA) dataset is useful for simulating systems and predict system events with high probability. This is achieved by computing QF lens distance-based variables associated to event probabilities from the dataset produced by field lenses that encode system states on a quantum level. The probability of a state transition (ST), doubles in prediction values at the decoding step, e.g., ST probabilities of P≥1/3 into P≥2/3 based on a single field (SF) transform into a quantum double-field (QDF). This transformation doubles the ST probability space via the field's scalar κ , in a published QDF method article. A QDF, as a double-field computation (DFC) model, simulates thermodynamic systems in predicting events by producing datasets from a QF-LCA, using laser cooling methods relative to high energy systems. The dataset can be used to, e.g., train quantum algorithms via quantum artificial intelligence (QAI) for a QF-LCA user. The user then decides after the algorithm predicts and suggests an efficient energy path for the system to choose. For example, an N-particle system simulated as a heat engine, by QAI classifier(s), predicts and reroutes particle energy paths on a logarithmic input-output scale. To determine system's energy change, the QDF lens code (DFC) measures entanglement entropy (EE). The algorithm's classification of EE values distinguishes entangled states in the system. The QF-LCA program employs the dataset to achieve an automated prediction and classification method, rather than dataset's manual use and analysis by the user. As the system evolves in its distribution of states, those particles not reaching a desired energy state (a target state or TS), i.e., the probability of observing a ground or excited state (GS or ES) outcome at the decoding step, can be rerouted by the heat engine to satisfy a TS outcome. This establishes a GS or ES energy profile to access and classify states by a classifier. The data points (qubits) in this profile are inverse distance-based and labelled for a specific class. After learning the profile, the classifier decodes and predicts the next system state. A QDF AI game "Alice & Bob's Quantum Doubles," is developed to validate the dataset as the P 's map for a classical/quantum prediction where the P 's of states and the user's P 's correlate in their value difference, ΔP . Dataset validation results are mapped to an intelligent decision simulator (IDS) as a QAI map. This maximizes system efficiency on a TS by EE of energy states (distributed in the system). Future additions to the dataset from the QAI map program can improve quantum algorithms to determine which particles of the system participate in a phase transition after state prediction. QF-LCA applications are in data science, security, forensics, particle physics, etc., such as retrieving or reconstructing information by distinguishing particle states from an evidence sample. Examples are, reconstruct damaged DNA strands of cells to predict a virus's TS, or cancer cell, its spread and growth against healthy cells, identify forged documents from genuine based on QDF's P values, and so on.
| S-EPMC11639746 | biostudies-literature
Project description:We consider a quantum sensor network of qubit sensors coupled to a field f ( x ; θ ) analytically parameterized by the vector of parameters θ . The qubit sensors are fixed at positions x 1, …, x d . While the functional form of f ( x ; θ ) is known, the parameters θ are not. We derive saturable bounds on the precision of measuring an arbitrary analytic function q( θ ) of these parameters and construct the optimal protocols that achieve these bounds. Our results are obtained from a combination of techniques from quantum information theory and duality theorems for linear programming. They can be applied to many problems, including optimal placement of quantum sensors, field interpolation, and the measurement of functionals of parametrized fields.
| S-EPMC9793443 | biostudies-literature
Project description:The complete blood count (CBC) is one of the most important clinical steps in clinical diagnosis. The instruments used for CBC are usually expensive and bulky and require well-trained operators. Therefore, it is difficult for medical institutions below the tertiary level to provide these instruments, especially in underprivileged countries. Several reported on-chip blood cell tests are still in their infancy and do not deviate from conventional microscopic or impedance measurement methods. In this study, we (i) combined magnetically activated cell sorting and the differential density method to develop a method to selectively isolate three types of leukocytes from blood and obtain samples with high purity and concentration for portable leukocyte classification using the lens-free shadow imaging technique (LSIT), and (ii) established several shadow parameters to identify the type of leukocytes in a complete leukocyte shadow image by shadow image analysis. The purity of the separated leukocytes was confirmed by flow cytometry. Several shadow parameters such as the "order ratio" and "minimum ratio" were developed to classify the three types of leukocytes. A shadow image library corresponding to each type of leukocyte was created from the tested samples. Compared with clinical reference data, a correlation index of 0.98 was obtained with an average error of 6% and a confidence level of 95%. This technique offers great potential for biological, pharmaceutical, environmental, and clinical applications, especially where point-of-care detection of rare cells is required.
| S-EPMC8869521 | biostudies-literature
Project description:Osteoarthritis (OA) is one of the most commonly occurring forms of arthritis in the world today. It is a debilitating chronic illness causing pain and immense discomfort to the affected individual. Significant research is currently ongoing to understand its pathophysiology and develop successful treatment regimens based on this knowledge. Animal models have played a key role in achieving this goal. Animal models currently used to study osteoarthritis can be classified based on the etiology under investigation, primary osteoarthritis, and post-traumatic osteoarthritis, to better clarify the relationship between these models and the pathogenesis of the disease. Non-invasive animal models have shown significant promise in understanding early osteoarthritic changes. Imaging modalities play a pivotal role in understanding the pathogenesis of OA and the correlation with pain. These imaging studies would also allow in vivo surveillance of the disease as a function of time in the animal model. This review summarizes the current understanding of the disease pathogenesis, invasive and non-invasive animal models, imaging modalities, and pain assessment techniques in the animals.
| S-EPMC4738796 | biostudies-other
Project description:Quantum computers are capable of calculating the energy difference of two electronic states using the quantum phase difference estimation (QPDE) algorithm. The Bayesian inference-based implementations for the QPDE have been reported so far, but in this approach, the quality of the calculated energy difference depends on the input wave functions being used. Here, we report the inverse quantum Fourier transformation-based QPDE with Na of ancillary qubits, which allows us to compute the difference of eigenenergies based on the single-shot projective measurement. As proof-of-concept demonstrations, we report numerical experiments for the singlet-triplet energy difference of the hydrogen molecule and the vertical excitation energies of halogen-substituted methylenes (CHF, CHCl, CF2, CFCl, and CCl2) and formaldehyde (HCHO).
| S-EPMC10653105 | biostudies-literature
Project description:BackgroundDomain experts manually construct the Structural Classification of Protein (SCOP) database to categorize and compare protein structures. Even though using the SCOP database is believed to be more reliable than classification results from other methods, it is labor intensive. To mimic human classification processes, we develop an automatic SCOP fold classification system to assign possible known SCOP folds and recognize novel folds for newly-discovered proteins.ResultsWith a sufficient amount of ground truth data, our system is able to assign the known folds for newly-discovered proteins in the latest SCOP v1.69 release with 92.17% accuracy. Our system also recognizes the novel folds with 89.27% accuracy using 10 fold cross validation. The average response time for proteins with 500 and 1409 amino acids to complete the classification process is 4.1 and 17.4 seconds, respectively. By comparison with several structural alignment algorithms, our approach outperforms previous methods on both the classification accuracy and efficiency.ConclusionIn this paper, we build an advanced, non-parametric classifier to accelerate the manual classification processes of SCOP. With satisfactory ground truth data from the SCOP database, our approach identifies relevant domain knowledge and yields reasonably accurate classifications. Our system is publicly accessible at http://ProteinDBS.rnet.missouri.edu/E-Predict.php.
| S-EPMC1579235 | biostudies-literature
Project description:The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamiltonians cannot be obtained efficiently with a classical computer. However, this challenge can be overcome by quantum computers. Here, we present a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain. The meaning of quantum generalization is twofold: The proposed algorithm is not only applicable to both classical and quantum systems, but also offers a quantum speedup relative to the classical counterpart. Furthermore, unlike the classical method of quantum Monte Carlo, this quantum algorithm does not suffer from the negative-sign problem associated with fermionic systems. Applications of this algorithm include the study of low-temperature properties of quantum systems, such as the Hubbard model, and preparing the thermal states of sizable molecules to simulate, for example, chemical reactions at an arbitrary temperature.
| S-EPMC3271878 | biostudies-literature
Project description:This SuperSeries is composed of the SubSeries listed below.
2014-11-24 | GSE62189 | GEO
Project description:This SuperSeries is composed of the SubSeries listed below. Refer to individual Series
2014-11-24 | E-GEOD-62189 | biostudies-arrayexpress
Project description:As a novel class of noncoding RNAs, long noncoding RNAs (lncRNAs) have been verified to be associated with various diseases. As large scale transcripts are generated every year, it is significant to accurately and quickly identify lncRNAs from thousands of assembled transcripts. To accurately discover new lncRNAs, we develop a classification tool of random forest (RF) named LncRNApred based on a new hybrid feature. This hybrid feature set includes three new proposed features, which are MaxORF, RMaxORF and SNR. LncRNApred is effective for classifying lncRNAs and protein coding transcripts accurately and quickly. Moreover,our RF model only requests the training using data on human coding and non-coding transcripts. Other species can also be predicted by using LncRNApred. The result shows that our method is more effective compared with the Coding Potential Calculate (CPC). The web server of LncRNApred is available for free at http://mm20132014.wicp.net:57203/LncRNApred/home.jsp.
| S-EPMC4882039 | biostudies-literature