Robuta

https://arxiv.org/abs/1104.1048 [1104.1048] Inverse scattering problem for quantum graph vertices Abstract page for arXiv paper 1104.1048: Inverse scattering problem for quantum graph vertices inverse scattering problemquantum graph11041048vertices https://www.kth.se/math/kalender/james-kennedy-optimising-the-fundamental-gap-of-a-quantum-graph-1.1339256?date=2024-06-26&orgdate=2024-02-13&length=1&orglength=0 James Kennedy: Optimising the fundamental gap of a quantum graph | KTH james kennedythe fundamentalquantum graph https://openreview.net/forum?id=rkxZveSFDS Quantum Graph Neural Networks | OpenReview Introducing a new class of quantum neural networks for learning graph-based representations on quantum computers. graph neural networksquantumopenreview https://www.mdpi.com/2075-1680/13/3/160 A Comparison between Invariant and Equivariant Classical and Quantum Graph Neural Networks Machine learning algorithms are heavily relied on to understand the vast amounts of data from high-energy particle collisions at the CERN Large Hadron Collider... a comparisonquantum graphinvariant https://arxiv.org/abs/2504.03429v1 [2504.03429v1] Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph... Abstract page for arXiv paper 2504.03429v1: Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks https://arxiv.org/abs/2604.12690 [2604.12690] Quantum graph models of quantum chaos: an introduction and some recent applications Abstract page for arXiv paper 2604.12690: Quantum graph models of quantum chaos: an introduction and some recent applications https://arxiv.org/abs/2310.10291 [2310.10291] Heralded Optical Entanglement Generation via the Graph Picture of Linear Quantum... Abstract page for arXiv paper 2310.10291: Heralded Optical Entanglement Generation via the Graph Picture of Linear Quantum Networks https://deepai.org/publication/quantum-speedup-for-graph-sparsification-cut-approximation-and-laplacian-solving Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving | DeepAI Nov 17, 2019 - 11/17/19 - Graph sparsification underlies a large number of algorithms, ranging from approximation algorithms for cut problems to solvers for... quantum speedupgraph https://www.mdpi.com/1099-4300/23/10/1239 Quantum Walk on the Generalized Birkhoff Polytope Graph We study discrete-time quantum walks on generalized Birkhoff polytope graphs (GBPGs), which arise in the solution-set to certain transportation linear... quantum walkon thebirkhoff polytopegeneralizedgraph https://deepai.org/publication/extreme-acceleration-of-graph-neural-network-based-prediction-models-for-quantum-chemistry Extreme Acceleration of Graph Neural Network-based Prediction Models for Quantum Chemistry | DeepAI Nov 25, 2022 - 11/25/22 - Molecular property calculations are the bedrock of chemical physics. High-fidelity ab initio modeling techniques for computing the... graph neural network https://straitsresearch.com/report/quantum-dot-solar-cell-market Quantum Dot Solar Cell Market Size, Share, Trends & Growth Graph by 2033 The global quantum dot solar cell market size is projected to grow from USD 5 billion in 2025 to USD 7.01 billion by 2033, exhibiting a CAGR of 4.3%. quantum dot solar cellmarket size https://arxiv.org/abs/0912.1217 [0912.1217] Quantum Hitting Time on the Complete Graph Abstract page for arXiv paper 0912.1217: Quantum Hitting Time on the Complete Graph hitting timeon the09121217quantum https://arxiv.org/abs/quant-ph/0303169?ref=qmedia.jp [quant-ph/0303169] Quantum query complexity of graph connectivity Abstract page for arXiv paper quant-ph/0303169: Quantum query complexity of graph connectivity quantum query complexityphconnectivity https://arxiv.org/abs/1907.00529 [1907.00529] Exponential-time quantum algorithms for graph coloring problems Abstract page for arXiv paper 1907.00529: Exponential-time quantum algorithms for graph coloring problems algorithms for graph coloringexponential time190700529quantum