Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 

Saved Queries

Sign in to use this feature.

Search Filter Reset All

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Subjects Reset
Select Subjects

Journals

remove_circle_outline
Add Journals Reset
Select Journals

Article Types

remove_circle_outline
Add Article Types Reset
Select Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
Add Countries / Regions Reset
Select Countries / Regions
Update Search
share announcement

Search Results (3)

Search Parameters:
Keywords = coherent ising machine (CIM)

Order results
Result details
Results per page
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
13 pages, 2862 KiB  
Article
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing
by Kaihan Fu, Jianjun Liu, Miao Chen and Huiying Zhang
Entropy 2025, 27(2), 189; https://doi.org/10.3390/e27020189 - 13 Feb 2025
Cited by 1 | Viewed by 1669
Abstract
Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling. To address this challenge, we propose a quantum computing approach for solving FJSPs. We propose a quadratic unconstrained [...] Read more.
Flexible job-shop scheduling problems (FJSPs) represent one of the most complex combinatorial optimization challenges. Modern production systems and control processes demand rapid decision-making in scheduling. To address this challenge, we propose a quantum computing approach for solving FJSPs. We propose a quadratic unconstrained binary optimization (QUBO) model to minimize the makespan of FJSPs, with the scheduling scheme encoded in the ground state of the Hamiltonian operator. The model is solved using a coherent Ising machine (CIM). Numerical experiments are conducted to evaluate and validate the performance and effectiveness of the CIM. The results demonstrate that quantum computing holds significant potential for solving FJSPs more efficiently than traditional computational methods. Full article
(This article belongs to the Special Issue Quantum Information: Working Towards Applications)
►▼ Show Figures

Figure 1

9 pages, 325 KiB  
Article
Quantum Computing in Community Detection for Anti-Fraud Applications
by Yanbo (Justin) Wang, Xuan Yang, Chao Ju, Yue Zhang, Jun Zhang, Qi Xu, Yiduo Wang, Xinkai Gao, Xiaofeng Cao, Yin Ma and Jie Wu
Entropy 2024, 26(12), 1026; https://doi.org/10.3390/e26121026 - 27 Nov 2024
Viewed by 2621
Abstract
Fraud detection within transaction data is crucial for maintaining financial security, especially in the era of big data. This paper introduces a novel fraud detection method that utilizes quantum computing to implement community detection in transaction networks. We model transaction data as an [...] Read more.
Fraud detection within transaction data is crucial for maintaining financial security, especially in the era of big data. This paper introduces a novel fraud detection method that utilizes quantum computing to implement community detection in transaction networks. We model transaction data as an undirected graph, where nodes represent accounts and edges indicate transactions between them. A modularity function is defined to measure the community structure of the graph. By optimizing this function through the Quadratic Unconstrained Binary Optimization (QUBO) model, we identify the optimal community structure, which is then used to assess the fraud risk within each community. Using a Coherent Ising Machine (CIM) to solve the QUBO model, we successfully divide 308 nodes into four communities. We find that the CIM computes faster than the classical Louvain and simulated annealing (SA) algorithms. Moreover, the CIM achieves better community structure than Louvain and SA as quantified by the modularity function. The structure also unambiguously identifies a high-risk community, which contains almost 70% of all the fraudulent accounts, demonstrating the practical utility of the method for banks’ anti-fraud business. Full article
(This article belongs to the Special Issue Quantum Information: Working Towards Applications)
►▼ Show Figures

Figure 1

16 pages, 2378 KiB  
Article
Computational Principle and Performance Evaluation of Coherent Ising Machine Based on Degenerate Optical Parametric Oscillator Network
by Yoshitaka Haribara, Shoko Utsunomiya and Yoshihisa Yamamoto
Entropy 2016, 18(4), 151; https://doi.org/10.3390/e18040151 - 19 Apr 2016
Cited by 51 | Viewed by 16828
Abstract
We present the operational principle of a coherent Ising machine (CIM) based on a degenerate optical parametric oscillator (DOPO) network. A quantum theory of CIM is formulated, and the computational ability of CIM is evaluated by numerical simulation based on c-number stochastic differential [...] Read more.
We present the operational principle of a coherent Ising machine (CIM) based on a degenerate optical parametric oscillator (DOPO) network. A quantum theory of CIM is formulated, and the computational ability of CIM is evaluated by numerical simulation based on c-number stochastic differential equations. We also discuss the advanced CIM with quantum measurement-feedback control and various problems which can be solved by CIM. Full article
(This article belongs to the Special Issue Quantum Information and Communication: From Foundations to Applications)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying article 1-50 on page 1 of 1.
Back to TopTop