Search Results for author:
Found 6 papers, 2 papers with code
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
With large optimality gaps observed in heuristic approaches, scalable exact methods are needed.
Optimal Layout Synthesis for Quantum Circuits as Classical Planning (full version)
Optimal Layout Synthesis is crucial for practical Quantum Computing on current error-prone hardware: Minimizing the number of SWAP gates directly mitigates the error rates when running quantum circuits.
Concise QBF Encodings for Games on a Grid (extended version)
To show the feasibility of such a generic approach, we use QBF solvers to compute the critical depths of winning strategies for instances of several known games.
Implicit State and Goals in QBF Encodings for Positional Games (extended version)
Our baseline is a QBF encoding with explicit variables for board positions and an explicit representation of winning configurations.
Classical Planning as QBF without Grounding (extended version)
Most classical planners use grounding as a preprocessing step, reducing planning to propositional logic.
Modeling and Verification of the Bitcoin Protocol
Bitcoin keeps a ledger of all transactions; the majority of the participants decides on the correct ledger.
Logic in Computer Science Cryptography and Security
