Go to main content
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Cite

Linked e-resources

Details

Intro
Preface
Organization
Contents - Part V
Quantum Computing
Searching B-Smooth Numbers Using Quantum Annealing: Applications to Factorization and Discrete Logarithm Problem
1 Introduction
2 Classical Methods for Integer Factorization and Discrete Logarithm
2.1 Quadratic Sieve Method
2.2 Index Calculus Method
3 Hybrid Methods
3.1 Known Results and Previous Work
3.2 Our Result
Factorization by Quantum Annealing as a Subroutine
3.3 Quantum Annealing Stage
Summary
4 Experiments
4.1 Results for Integer Factorization

4.2 Results for Discrete Logarithm Problem over Prime Field
5 Summary
References
Classification of Hybrid Quantum-Classical Computing
1 Introduction
2 Literature
3 Types of Hybrid Computing
3.1 Vertical Hybrid Quantum Computing
3.2 Horizontal Hybrid Quantum Computing
4 Application
5 Conclusions
References
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
1 Introduction
2 Foundations
2.1 Satisfiability Problems
2.2 Quadratic Unconstrained Binary Optimization
3 Related Work
3.1 Chancellorn+m
3.2 Choi3m
4 Approaches

4.1 A 2n + m Approach
4.2 An n + m Approach
5 Empirical Evaluation
6 Conclusion and Future Work
References
Black Box Optimization Using QUBO and the Cross Entropy Method
1 Introduction
2 Background
2.1 MAX-SAT
2.2 Feedback Vertex Set (FVS)
2.3 MaxClique
2.4 Quadratic Unconstrained Binary Optimization (QUBO)
2.5 Cross-Entropy Method
3 Related Work
4 Black Box Optimization with Cross Entropy and QUBO (BOX-QUBO)
5 Experiments
6 Conclusion and Future Work
References
Sub-exponential ML Algorithm for Predicting Ground State Properties

1 Introduction
2 Preliminaries and Related Work
2.1 Formulation
2.2 Classical Shadows
2.3 Predicting Ground States of Quantum Many-Body Systems
3 Proposed Method
3.1 Idea
3.2 Algorithm Details
4 Conclusion
References
Quantum Factory Method: A Software Engineering Approach to Deal with Incompatibilities in Quantum Libraries
1 Introduction
2 State of the Art
2.1 Quantum Software Engineering
2.2 OpenQASM: A Not-so-Standard Standard
3 Proposal
3.1 Design Patterns
3.2 Application
4 Examples
4.1 Building Simple Circuits

4.2 Building Quantum Rule-Based Systems
4.3 Experiments and Results
5 Discussion and Conclusions
References
A Polynomial Size Model with Implicit SWAP Gate Counting for Exact Qubit Reordering
1 Introduction
2 Background
2.1 Building Blocks of QC
2.2 Decomposing Multi-qubit Gates
3 Problem Definition
4 Mathematical Model
5 Experimental Results
5.1 Experimental Setup
5.2 Results
6 Conclusion
References
Translating Constraints into QUBOs for the Quadratic Knapsack Problem
1 Introduction
2 Background
2.1 Quantum and Simulated Annealing

Browse Subjects

Show more subjects...

Statistics

from
to
Export