Classical computation over quantum architectures. From graph encoding to declarative languages compilation

DOI10.1093/LOGCOM/EXAE040MaRDI QIDQ7004084zbMATH OpenFDO

Authors Alex Della Schiava, Carla Piazza, R. Romanello

Publication date 3 April 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAE040

zbMATH Keywords

declarative languagesgraph theoryprogramming languagesquantum computing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Quantum algorithms and complexity in the theory of computing (68Q12) Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68)

Cites work

• A graph-theoretic approach to map conceptual designs to XML schemas
• A Short Introduction to Fibonacci Anyon Models
• Adiabatic quantum computation is equivalent to standard quantum computation
• Advanced exact synthesis of Clifford+T circuits
• ASPARTIX-V19 -- an answer-set programming based system for abstract argumentation
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Computing the shortest path: A^ search meets graph theory
• Directed graph encoding in quantum computing supporting edge-failures
• Generalized cluster states based on finite groups
• scientific article; zbMATH DE number 3737613 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1273988 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3346357 (Why is no real title available?)
• Laplacians and the Cheeger inequality for directed graphs
• Matrix Analysis
• On the Digraph of a Unitary Matrix
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Proportional lumpability
• Quantum approaches to graph colouring
• Quantum computation by measurement and quantum memory
• Quantum encoding of dynamic directed graphs
• Quantum stochastic optimization
• Quantum weighted model counting
• QUBO formulations for the graph isomorphism problem and related problems
• Solving Advanced Argumentation Problems with Answer Set Programming
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• The unconstrained binary quadratic programming problem: a survey

This page was built for publication: Classical computation over quantum architectures. From graph encoding to declarative languages compilation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7004084)