Skip to content
This repository has been archived by the owner on Feb 5, 2020. It is now read-only.

Hardware Efficient Quantum Computing via Circuit Decomposition #14

Open
zguo0525 opened this issue Feb 2, 2020 · 0 comments
Open

Hardware Efficient Quantum Computing via Circuit Decomposition #14

zguo0525 opened this issue Feb 2, 2020 · 0 comments

Comments

@zguo0525
Copy link

zguo0525 commented Feb 2, 2020

Quantum computing is a promising technology for various applications like quantum optimization, quantum machine learning, and quantum chemistry. However, with the limited number of qubits, the limited depth of circuit, and high error rate in the two-qubit gate, near-term quantum circuits can be challenging to maintain the resultant quantum state. Such limitations severely hinders the practical applications and commercialization of quantum technology. Therefore, it's ideal to reduce the number of qubits requirement for quantum algorithms to run on the near term quantum device. In this project, we apply the quantum circuit decomposition in IBM Q Experience to demonstrate the idea of reducing the qubit number requirement for realizing the quantum optimization with VQE solver. With max-cut problem to solve, we successfully run the VQE solver on a 3 qubits IBM chip that, in essence, requires 4 qubits. And we further run a 6 qubits solver on a 5 qubit simulator. Our circuit decomposition method is general, not bounded by the algorithms to run or number of qubits. In particular, when applied to the near-term quantum device, it may empower the quantum technology.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant