scholarly journals Evolving blackbox quantum algorithms using genetic programming

2008 ◽  
Vol 22 (3) ◽  
pp. 285-297 ◽  
Author(s):  
Ralf Stadelhofer ◽  
Wolfgang Banzhaf ◽  
Dieter Suter
Keyword(s):  
Decision Tree ◽  
Genetic Programming ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Query Complexity ◽  
Quantum Computers ◽  
Programming System ◽  
Tree Model ◽  
New Techniques ◽  
Parity Problem

AbstractAlthough it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have been developed so far. Designing such algorithms is complicated by the rather nonintuitive character of quantum physics. In this paper we present a genetic programming system that uses some new techniques to develop and improve quantum algorithms. We have used this system to develop two formerly unknown quantum algorithms. We also address a potential deficiency of the quantum decision tree model used to prove lower bounds on the query complexity of the parity problem.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Introduction and Background

2006 ◽  
Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca
Keyword(s):  
Information Processing ◽  
Quantum Information ◽  
Quantum Physics ◽  
Quantum Information Processing ◽  
Quantum Algorithms ◽  
Physical Reality ◽  
Quantum Computers ◽  
Processing Task ◽  
Computing Model ◽  
Physical Task

A computer is a physical device that helps us process information by executing algorithms. An algorithm is a well-defined procedure, with finite description, for realizing an information-processing task. An information-processing task can always be translated into a physical task. When designing complex algorithms and protocols for various information-processing tasks, it is very helpful, perhaps essential, to work with some idealized computing model. However, when studying the true limitations of a computing device, especially for some practical reason, it is important not to forget the relationship between computing and physics. Real computing devices are embodied in a larger and often richer physical reality than is represented by the idealized computing model. Quantum information processing is the result of using the physical reality that quantum theory tells us about for the purposes of performing tasks that were previously thought impossible or infeasible. Devices that perform quantum information processing are known as quantum computers. In this book we examine how quantum computers can be used to solve certain problems more efficiently than can be done with classical computers, and also how this can be done reliably even when there is a possibility for errors to occur. In this first chapter we present some fundamental notions of computation theory and quantum physics that will form the basis for much of what follows. After this brief introduction, we will review the necessary tools from linear algebra in Chapter 2, and detail the framework of quantum mechanics, as relevant to our model of quantum computation, in Chapter 3. In the remainder of the book we examine quantum teleportation, quantum algorithms and quantum error correction in detail. We are often interested in the amount of resources used by a computer to solve a problem, and we refer to this as the complexity of the computation. An important resource for a computer is time. Another resource is space, which refers to the amount of memory used by the computer in performing the computation. We measure the amount of a resource used in a computation for solving a given problem as a function of the length of the input of an instance of that problem.

THEORETICAL BASICS OF QUANTUM COMPUTATIONS

2021 ◽  
Vol 158 (3-4) ◽  
pp. 7-38
Author(s):  
Tomasz Kuczerski ◽  
Michał Dyszyński
Keyword(s):  
Quantum Information ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Basic Information ◽  
Basic Principles ◽  
The World ◽  
Quantum Computations

The paper includes basic information over the domain of quantum physics needed to understand basic principles of calculations and operations with the use of quantum computers. Questions of the unit of quantum information – qubit, and the Bloch’s zone are thoroughly explained. The paper is aimed to be an introduction into the world of quantum IT for persons beyond the quantum physics who want to use the quantum algorithms for their scientific researches.

A novel enhanced decision tree model for detecting chronic kidney disease

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Avijit Kumar Chaudhuri ◽  
Deepankar Sinha ◽  
Dilip K. Banerjee ◽  
Anirban Das
Keyword(s):  
Chronic Kidney Disease ◽  
Kidney Disease ◽  
Decision Tree ◽  
Decision Tree Model ◽  
Tree Model

scholarly journals Practical Security of RSA Against NTC-Architecture Quantum Computing Attacks

2021 ◽  
Author(s):  
Kai Li ◽  
Qing-yu Cai
Keyword(s):  
Quantum Computing ◽  
Ion Trap ◽  
Quantum Algorithms ◽  
Coherence Time ◽  
Quantum Computers ◽  
Quantum Time ◽  
Speed Up ◽  
Key Length ◽  
Concurrent Architecture ◽  
Qubit Gate

AbstractQuantum algorithms can greatly speed up computation in solving some classical problems, while the computational power of quantum computers should also be restricted by laws of physics. Due to quantum time-energy uncertainty relation, there is a lower limit of the evolution time for a given quantum operation, and therefore the time complexity must be considered when the number of serial quantum operations is particularly large. When the key length is about at the level of KB (encryption and decryption can be completed in a few minutes by using standard programs), it will take at least 50-100 years for NTC (Neighbor-only, Two-qubit gate, Concurrent) architecture ion-trap quantum computers to execute Shor’s algorithm. For NTC architecture superconducting quantum computers with a code distance 27 for error-correcting, when the key length increased to 16 KB, the cracking time will also increase to 100 years that far exceeds the coherence time. This shows the robustness of the updated RSA against practical quantum computing attacks.

scholarly journals Decision Tree-Based Adaptive Reconfigurable Cache Scheme

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 176
Author(s):  
Wei Zhu ◽  
Xiaoyang Zeng
Keyword(s):  
Decision Tree ◽  
Adaptive Algorithms ◽  
Memory Access ◽  
Access Time ◽  
Decision Tree Algorithm ◽  
Verilog Hdl ◽  
Tree Model ◽  
Cache Associativity ◽  
Cache Scheme ◽  
Reconfigurable Cache

Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system. To solve this problem, we propose a real-time adaptive reconfigurable cache based on the decision tree algorithm, which can optimize the average memory access time of cache without modifying the cache coherent protocol. By monitoring the application running state, the cache associativity is periodically tuned to the optimal cache associativity, which is determined by the decision tree model. This paper implements the proposed decision tree-based adaptive reconfigurable cache in the GEM5 simulator and designs the key modules using Verilog HDL. The simulation results show that the proposed decision tree-based adaptive reconfigurable cache reduces the average memory access time compared with other adaptive algorithms.

scholarly journals Risk of Pre-Malignancy or Malignancy in Postmenopausal Endometrial Polyps: A CHAID Decision Tree Analysis

Diagnostics ◽  
2021 ◽  
Vol 11 (6) ◽  
pp. 1094
Author(s):  
Michael Wong ◽  
Nikolaos Thanatsis ◽  
Federica Nardelli ◽  
Tejal Amin ◽  
Davor Jurkovic
Keyword(s):  
Decision Tree ◽  
Expectant Management ◽  
Decision Tree Model ◽  
Decision Tree Analysis ◽  
Focal Lesions ◽  
Tree Model ◽  
Normal Endometrium ◽  
Endometrial Polyps ◽  
Tree Analysis ◽  
Interaction Detection

Background and aims: Postmenopausal endometrial polyps are commonly managed by surgical resection; however, expectant management may be considered for some women due to the presence of medical co-morbidities, failed hysteroscopies or patient’s preference. This study aimed to identify patient characteristics and ultrasound morphological features of polyps that could aid in the prediction of underlying pre-malignancy or malignancy in postmenopausal polyps. Methods: Women with consecutive postmenopausal polyps diagnosed on ultrasound and removed surgically were recruited between October 2015 to October 2018 prospectively. Polyps were defined on ultrasound as focal lesions with a regular outline, surrounded by normal endometrium. On Doppler examination, there was either a single feeder vessel or no detectable vascularity. Polyps were classified histologically as benign (including hyperplasia without atypia), pre-malignant (atypical hyperplasia), or malignant. A Chi-squared automatic interaction detection (CHAID) decision tree analysis was performed with a range of demographic, clinical, and ultrasound variables as independent, and the presence of pre-malignancy or malignancy in polyps as dependent variables. A 10-fold cross-validation method was used to estimate the model’s misclassification risk. Results: There were 240 women included, 181 of whom presented with postmenopausal bleeding. Their median age was 60 (range of 45–94); 18/240 (7.5%) women were diagnosed with pre-malignant or malignant polyps. In our decision tree model, the polyp mean diameter (≤13 mm or >13 mm) on ultrasound was the most important predictor of pre-malignancy or malignancy. If the tree was allowed to grow, the patient’s body mass index (BMI) and cystic/solid appearance of the polyp classified women further into low-risk (≤5%), intermediate-risk (>5%–≤20%), or high-risk (>20%) groups. Conclusions: Our decision tree model may serve as a guide to counsel women on the benefits and risks of surgery for postmenopausal endometrial polyps. It may also assist clinicians in prioritizing women for surgery according to their risk of malignancy.

scholarly journals Deep neural networks for quantum circuit mapping

2021 ◽  
Author(s):  
Giovanni Acampora ◽  
Roberto Schiattarella
Keyword(s):  
Neural Networks ◽  
Deep Neural Networks ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Machine Learning Techniques ◽  
Quantum Computers ◽  
Physical Constraints ◽  
Proper Mapping ◽  
Correct Execution

AbstractQuantum computers have become reality thanks to the effort of some majors in developing innovative technologies that enable the usage of quantum effects in computation, so as to pave the way towards the design of efficient quantum algorithms to use in different applications domains, from finance and chemistry to artificial and computational intelligence. However, there are still some technological limitations that do not allow a correct design of quantum algorithms, compromising the achievement of the so-called quantum advantage. Specifically, a major limitation in the design of a quantum algorithm is related to its proper mapping to a specific quantum processor so that the underlying physical constraints are satisfied. This hard problem, known as circuit mapping, is a critical task to face in quantum world, and it needs to be efficiently addressed to allow quantum computers to work correctly and productively. In order to bridge above gap, this paper introduces a very first circuit mapping approach based on deep neural networks, which opens a completely new scenario in which the correct execution of quantum algorithms is supported by classical machine learning techniques. As shown in experimental section, the proposed approach speeds up current state-of-the-art mapping algorithms when used on 5-qubits IBM Q processors, maintaining suitable mapping accuracy.

scholarly journals Coreset Clustering on Small Quantum Computers

Electronics ◽  
2021 ◽  
Vol 10 (14) ◽  
pp. 1690
Author(s):  
Teague Tomesh ◽  
Pranav Gokhale ◽  
Eric R. Anschuetz ◽  
Frederic T. Chong
Keyword(s):  
Quantum Algorithms ◽  
Quantum Computers ◽  
Data Sets ◽  
New Paradigm ◽  
Data Set ◽  
Small Quantum ◽  
Natural Data ◽  
Near Term ◽  
Classical Computing ◽  
Quantum Speedup

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.

scholarly journals Reanalysis and External Validation of a Decision Tree Model for Detecting Unrecognized Diabetes in Rural Chinese Individuals

2017 ◽  
Vol 2017 ◽  
pp. 1-6 ◽  
Author(s):  
Zhong Xin ◽  
Lin Hua ◽  
Xu-Hong Wang ◽  
Dong Zhao ◽  
Cai-Guo Yu ◽  
...  
Keyword(s):  
Decision Tree ◽  
Predictive Value ◽  
Early Stage ◽  
Current Model ◽  
External Validation ◽  
Area Under The Curve ◽  
Decision Tree Model ◽  
Tree Model ◽  
Chinese Adult ◽  
Significant Difference

We reanalyzed previous data to develop a more simplified decision tree model as a screening tool for unrecognized diabetes, using basic information in Beijing community health records. Then, the model was validated in another rural town. Only three non-laboratory-based risk factors (age, BMI, and presence of hypertension) with fewer branches were used in the new model. The sensitivity, specificity, positive predictive value, negative predictive value, and area under the curve (AUC) for detecting diabetes were calculated. The AUC values in internal and external validation groups were 0.708 and 0.629, respectively. Subjects with high risk of diabetes had significantly higher HOMA-IR, but no significant difference in HOMA-B was observed. This simple tool will help general practitioners and residents assess the risk of diabetes quickly and easily. This study also validates the strong associations of insulin resistance and early stage of diabetes, suggesting that more attention should be paid to the current model in rural Chinese adult populations.

Sign in / Sign up

Export Citation Format

Share Document