https://github.com/ritu-thombre99/qft-adder-based-mct-gate
Efficient QFT Adder based MCT gate
https://github.com/ritu-thombre99/qft-adder-based-mct-gate
mct-gate optimization qft qft-adder qiskit quantumc
Last synced: 8 months ago
JSON representation
Efficient QFT Adder based MCT gate
- Host: GitHub
- URL: https://github.com/ritu-thombre99/qft-adder-based-mct-gate
- Owner: ritu-thombre99
- License: apache-2.0
- Created: 2022-06-17T12:08:10.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-09-06T21:33:09.000Z (about 1 year ago)
- Last Synced: 2025-01-05T06:27:18.774Z (9 months ago)
- Topics: mct-gate, optimization, qft, qft-adder, qiskit, quantumc
- Language: Jupyter Notebook
- Homepage:
- Size: 955 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# QFT-Adder-based-MCT-Gate
Efficient QFT Adder based MCT gate demonstrated in the notebook using 14 control qubits
## Traditional MCT Gate
+ MCT Gate (Multi-Controller Tofolli) gates are multi qubit gates which change the status of target qubit based on states of control qubits
+ If all control qubits are in state |1> then state of the target qubit is flipped
+ To reduce the gate count and depth of MCT operations, qiskit provides option to use ancilla bits
+ If there are n control qubits, at least (n-2) ancilla bits are required to execute MCT gate
## QFT Adder based MCT Gate
+ In the modified QFT Adder based MCT gate approach, number of control qubits in state |1> are counted and stored in ancilla bits using QFT adder
+ If binary number represented in ancilla bits is equal to the number of control qubits, target qubit is flipped
+ If there are n control qubits, then the number of ancilla bits required is log2(n+1). Hence, space complexity is improved drastically
+ Disadvantage here is that QFT Adder based MCT gate cannot be implemented without ancilla bits