Spatial-photonic Boltzmann machines: low-rank combinatorial optimization and statistical learning by spatial light modulation

The spatial-photonic Ising machine (SPIM) [D. Pierangeli et al., Phys. Rev. Lett. 122, 213902 (2019)] is a promising optical architecture utilizing spatial light modulation for solving large-scale combinatorial optimization problems efficiently. However, the SPIM can accommodate Ising problems with only rank-one interaction matrices, which limits its applicability to various real-world problems. In this Letter, we propose a new computing model for the SPIM that can accommodate any Ising problem without changing its optical implementation. The proposed model is particularly efficient for Ising problems with low-rank interaction matrices, such as knapsack problems. Moreover, the model acquires learning ability and can thus be termed a spatial-photonic Boltzmann machine (SPBM). We demonstrate that learning, classification, and sampling of the MNIST handwritten digit images are achieved efficiently using SPBMs with low-rank interactions. Thus, the proposed SPBM model exhibits higher practical applicability to various problems of combinatorial optimization and statistical learning, without losing the scalability inherent in the SPIM architecture.Comment: 7 pages, 5 figures (with a 3-page supplemental

Benchmarks and Controls for Optimization with Quantum Annealing

Quantum annealing (QA) is a metaheuristic specialized for solving optimization problems which uses principles of adiabatic quantum computing, namely the adiabatic theorem. Some devices implement QA using quantum mechanical phenomena. These QA devices do not perfectly adhere to the adiabatic theorem because they are subject to thermal and magnetic noise. Thus, QA devices return statistical solutions with some probability of success where this probability is affected by the level of noise of the system. As these devices improve, it is believed that they will become less noisy and more accurate. However, some tuning strategies may further improve that probability of finding the correct solution and reduce the effects of noise on solution outcome. In this dissertation, these tuning strategies are explored in depth to determine the effect of preprocessing, annealing, and post-processing controls on performance. In particular, these tuning strategies were applied to a real-world NP (nondeterministic polynomial time)-hard optimization problem and portfolio optimization. Although the performance improved very little from tuning the spin reversal transforms, anneal time, and embedding, the results revealed that reverse annealing controls improved the probability of success by an order of magnitude over forward annealing alone. The chain strength experiments revealed that increasing the strength of the intra-chain coupling improves the probability of success until the intra-chain coupling strengths begin to overpower the inter-chain couplings. By taking a closer look at each physical qubit in the embedded chains, the probability for each qubit to be faulty was visualized and was used to develop a post-processing strategy that outperformed the standard, which chooses a logical qubit value from a broken chain. The results of these findings provide a guide for researchers to find the optimal set of controls for their unique real-world optimization problem to determine whether QA provides some benefit over classical computing, lay the groundwork for developing new tuning strategies that could further improve performance, and characterize the current hardware for benchmarking future generations of QA hardware