Žnidarič, 2005 - Google Patents
Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiabilityŽnidarič, 2005
View PDF- Document ID
- 12473748458560561559
- Author
- Žnidarič M
- Publication year
- Publication venue
- Physical Review A—Atomic, Molecular, and Optical Physics
External Links
Snippet
We numerically study the quantum adiabatic algorithm for propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size …
- 238000004422 calculation algorithm 0 title abstract description 34
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30705—Clustering or classification
- G06F17/3071—Clustering or classification including class or cluster creation or modification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30613—Indexing
- G06F17/30619—Indexing indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computer systems based on specific mathematical models
- G06N7/02—Computer systems based on specific mathematical models using fuzzy logic
- G06N7/023—Learning or tuning the parameters of a fuzzy system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computer systems based on specific mathematical models
- G06N7/005—Probabilistic networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Hogg | Adiabatic quantum computing for random satisfiability problems | |
Žnidarič | Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability | |
Childs et al. | Spatial search by quantum walk | |
Wu et al. | An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems | |
Childs | Quantum information processing in continuous time | |
Latorre et al. | Adiabatic quantum computation and quantum phase transitions | |
Ansótegui et al. | Random SAT instances à la carte | |
Azzolini et al. | Abduction with probabilistic logic programming under the distribution semantics | |
Turtletaub et al. | Application of quantum machine learning to VLSI placement | |
Kapsalis et al. | The radio link frequency assignment problem: A case study using genetic algorithms | |
Rice et al. | A survey of static variable ordering heuristics for efficient BDD/MDD construction | |
Giráldez et al. | Knowledge-based fast evaluation for evolutionary learning | |
Sergienko et al. | Problems of discrete optimization: Challenges and main approaches to solve them | |
Baluja | Using a priori knowledge to create probabilistic models for optimization | |
Santana et al. | Adaptive estimation of distribution algorithms | |
Jones et al. | Exact correlations in topological quantum chains | |
Cristani et al. | Classification Rules Explain Machine Learning. | |
Sedlacek et al. | Importance analysis of multi-state system based on incompletely specified data by multi-valued decision diagrams | |
Chemchem et al. | Multilevel clustering of induction rules for web meta-knowledge | |
Enembreck et al. | Decision tree-based paraconsistent learning | |
Ostrowski | Simulation of the excited state decay in the quantum register | |
Jin et al. | A non-dominated sorting memetic algorithm for the multi-objective travelling salesman problem | |
Vinceslas et al. | SPAMS: A novel incremental approach for sequential pattern mining in data streams | |
Ba-Alwi | Knowledge acquisition tool for classification rules using genetic algorithm approach | |
Ammermann et al. | Quantum Solution for Configuration Selection and Prioritization |