8 citations · 25 across the 12 of their papers we have counts for
4 papers · 2 filters
Harnessing a 256-qubit Neutral Atom Simulator for Graph Classification
Edoardo Giusto, Gabriele Iurlaro, Bartolomeo Montrucchio +5
Neutral atom platforms are analogue quantum simulators that offer the possibility to map graphs onto a 2D qubit register using programmable Rubidium atoms arrays, whose valence ele…
Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems
Chiara Vercellino, Paolo Viviani, Giacomo Vitali +5
Graph embedding is a recurrent problem in quantum computing, for instance, quantum annealers need to solve a minor graph embedding in order to map a given Quadratic Unconstrained B…
Neural optimization for quantum architectures: graph embedding problems with Distance Encoder Networks
Chiara Vercellino, Giacomo Vitali, Paolo Viviani +5
Quantum machines are among the most promising technologies expected to provide significant improvements in the following years. However, bridging the gap between real-world applica…
BBQ-mIS: a parallel quantum algorithm for graph coloring problems
Chiara Vercellino, Giacomo Vitali, Paolo Viviani +5
Among the limitations of current quantum machines, the qubits count represents one of the most critical challenges for porting reasonably large computational problems, such as thos…