Image de couverture de livre

A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Morse, Gregory, Kozsik, Tamás, Mencer, Oskar, Rakyta, Peter
Format:	Preprint
Publié:	2024
Sujets:	Cryptography and Security Mathematical Physics Quantum Physics 68Q25 (Primary) 68R05, 94A60, 90C20 (Secondary) F.2.2; G.2.1; E.3; F.1.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations
par: Guseynov, Nikita, et autres
Publié: (2024)

Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs
par: Morse, Gregory, et autres
Publié: (2026)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

Quantum Algorithm for Local-Volatility Option Pricing via the Kolmogorov Equation
par: Guseynov, Nikita, et autres
Publié: (2025)

Efficient explicit circuit for quantum state preparation of piecewise continuous functions
par: Guseynov, Nikita, et autres
Publié: (2024)

Emulation-Completeness of Programming Languages
par: Morse, Gregory, et autres
Publié: (2026)

Quantum walk informed variational algorithm design
par: Matwiejew, Edric, et autres
Publié: (2024)

Practical Quantum CIM Empowerment via All-Domestic-Core Agentic Large Model
par: Rui, Wang, et autres
Publié: (2026)

Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions
par: Guseynov, Nikita, et autres
Publié: (2025)

Quantum Advantage in Computational Chemistry?
par: Gundlach, Hans, et autres
Publié: (2025)

A quantum implementation of high-order power method for estimating geometric entanglement of pure states
par: Semenov, Andrii, et autres
Publié: (2024)

Advances in Quantum Genetic Algorithms
par: Lima, Dennis, et autres
Publié: (2025)

Computational Phase Transitions in Binary Compressed Sensing: Quantum Annealing Inside the Relaxation Gap
par: Hahn, William, et autres
Publié: (2026)

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective
par: Al-atar, Munqath, et autres
Publié: (2024)

Approximate Integrity Constraints in Incomplete Databases With Limited Domains
par: Al-atar, Munqath, et autres
Publié: (2024)

Pauli-structured preconditioning for quantum linear system solvers
par: Nie, Hantao, et autres
Publié: (2026)

Quantum Deep Learning Still Needs a Quantum Leap
par: Gundlach, Hans, et autres
Publié: (2025)

Completeness classes in algebraic complexity theory
par: Bürgisser, Peter
Publié: (2024)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
par: Kumar, Mrinal, et autres
Publié: (2018)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)

Reliable Optimization Under Noise in Quantum Variational Algorithms
par: Novák, Vojtěch, et autres
Publié: (2025)

Tensor Decomposition for Non-Clifford Gate Minimization
par: Khoruzhii, Kirill, et autres
Publié: (2026)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
par: Bärligea, Adelina, et autres
Publié: (2025)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
par: Hancock, James, et autres
Publié: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

Enhanced Rényi Entropy-Based Post-Quantum Key Agreement with Provable Security and Information-Theoretic Guarantees
par: Xu, Ruopengyu, et autres
Publié: (2025)

Efficient Binary Decision Diagram Manipulation in External Memory
par: Sølvsten, Steffan Christ, et autres
Publié: (2021)

Discovering Algorithms with Computational Language Processing
par: Bourdais, Theo, et autres
Publié: (2025)

Shifted Partial Derivative Polynomial Rank and Codimension
par: Edwards, Darren J.
Publié: (2025)

Quantum Search without Global Diffusion
par: Burke, John, et autres
Publié: (2026)

Simulating high-accuracy nuclear motion Hamiltonians using discrete variable representation and Walsh-Hadamard QROM on fault-tolerant quantum computers
par: Szczepanik, Michał, et autres
Publié: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

The Impact of Partial Computations on the Red-Blue Pebble Game
par: Papp, Pál András, et autres
Publié: (2025)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
par: Hancock, James, et autres
Publié: (2023)

Vanishing L2 regularization for the softmax Multi Armed Bandit
par: Anita, Stefana-Lucia, et autres
Publié: (2026)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
par: Sølvsten, Steffan Christ, et autres
Publié: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)