Quantum Algorithm for Machine Learning and Circuit Design Based on Optimization of Ternary - Input, Binary-Output Kronecker-Reed-Muller Forms

Author(s):  
Maggie Bao ◽  
Cole Powers ◽  
Marek Perkowski
2014 ◽  
Vol 16 (7) ◽  
pp. 073017 ◽  
Author(s):  
Jeongho Bang ◽  
Junghee Ryu ◽  
Seokwon Yoo ◽  
Marcin Pawłowski ◽  
Jinhyoung Lee

Impact ◽  
2020 ◽  
Vol 2020 (1) ◽  
pp. 9-11
Author(s):  
Nobukazu Takai

The 21st century has given rise to a digital world which has significantly impacted on the ways in which humans go about their everyday lives. From being able to speak with whomever you want, whenever you want, wherever you are on your smartphone, to tapping away on your laptop, through to spending hours each day on the internet, the world we live in is firmly digital and it now shapes the way we experience life. When it comes to circuits, analog still has a hugely important role to play. Circuit designer Associate Professor Nobukazu Takai is leading a team of researchers who are applying machine learning to analog circuit design. They are the first team to do this anywhere in the world and, using their method, computers are able to learn how to improve their own circuit specifications.


2020 ◽  
Vol 20 (9&10) ◽  
pp. 766-786
Author(s):  
Wenjun Hou ◽  
Marek Perkowski

The Knapsack Problem is a prominent problem that is used in resource allocation and cryptography. This paper presents an oracle and a circuit design that verifies solutions to the decision problem form of the Bounded Knapsack Problem. This oracle can be used by Grover Search to solve the optimization problem form of the Bounded Knapsack Problem. This algorithm leverages the quadratic speed-up offered by Grover Search to achieve a quantum algorithm for the Knapsack Problem that shows improvement with regard to classical algorithms. The quantum circuits were designed using the Microsoft Q# Programming Language and verified on its local quantum simulator. The paper also provides analyses of the complexity and gate cost of the proposed oracle. The work in this paper is the first such proposed method for the Knapsack Optimization Problem.


2013 ◽  
Vol 15 (1) ◽  
pp. 013021 ◽  
Author(s):  
Yudong Cao ◽  
Anargyros Papageorgiou ◽  
Iasonas Petras ◽  
Joseph Traub ◽  
Sabre Kais

Author(s):  
Brett Shook ◽  
Prateek Bhansali ◽  
Chandramouli Kashyap ◽  
Chirayu Amin ◽  
Siddhartha Joshi

Sign in / Sign up

Export Citation Format

Share Document