返回
Computing graph edit distance on quantum devices
DOI:10.1007/s42484-022-00077-x.png)
摘要
En 中文
Distance measures provide the foundation for many popular algorithms in Machine Learning and Pattern Recognition. Different notions of distance can be used depending on the types of the data the algorithm is working on. For graph-shaped data, an important notion is the Graph Edit Distance (GED) that measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. As the complexity of computing GED is the same as NP-hard problems, it is reasonable to consider approximate solutions. In this paper, we present a QUBO formulation of the GED problem. This allows us to implement two different approaches, namely quantum annealing and variational quantum algorithms, that run on the two types of quantum hardware currently available: quantum annealer and gate-based quantum computer, respectively. Considering the current state of noisy intermediate-scale quantum computers, we base our study on proof-of-principle tests of their performance.
Keyword:
Graph edit distance
Quantum annealing
Variational quantum algorithms
期刊
Q
IF:
4.4
论文数:
439
被引数:
796
机构
引用论文
Signal transducer and activator of transcription 3 involvement in the development of renal interstitial fibrosis after unilateral ureteral obstruction
Nephrology
IF0
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
NATURE COMMUNICATIONS
IF15.7
Bortezomib, Lenalidomide and Dexamethasone Vs. Lenalidomide and Dexamethasone in Patients (Pts) with Previously Untreated Multiple Myeloma without an Intent for Immediate Autologous Stem Cell Transplant (ASCT): Results of the Randomized Phase III Trial SWOG S0777
Blood
IF0
Estimating inbreeding rate and effective population size in the Finnish Ayrshire population in the era of genomic selection在基因组选择时代估计芬兰阿菲尔夏洛莱牛群的近交率和有效群体规模

