Quantum Image Preparation Based on Exclusive Sum-of-Product Minimization
and Ternary Trees
- URL: http://arxiv.org/abs/1912.12599v1
- Date: Sun, 29 Dec 2019 07:31:42 GMT
- Title: Quantum Image Preparation Based on Exclusive Sum-of-Product Minimization
and Ternary Trees
- Authors: Younatan Matthew and Ghose Shohini
- Abstract summary: The complexity overhead to design circuits to represent quantum images is a significant problem.
We propose a new method to minimize the total number required of quantum gates to represent the quantum image.
Our approach uses ternary trees to reduce the number of Toffoli gates in a quantum image circuit.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum image processing is one of the promising fields of quantum
information. The complexity overhead to design circuits to represent quantum
images is a significant problem. So, we proposed a new method to minimize the
total number required of quantum gates to represent the quantum image. Our
approach uses ternary trees to reduce the number of Toffoli gates in a quantum
image circuit. Also, it uses the complement property of Boolean algebra on a
set of Toffoli gates to combine two Toffoli gates into one, therefore reducing
the number of overall gates. Ternary trees are used to represent Toffoli gates
as they significantly increase run time and is supported through experiments on
sample images. The experimental results show that there is a high-speed up
compared with previous methods, bringing the processing time for thousands of
Toffoli gates from minutes to seconds.
Related papers
- Cost-Effective Realization of n-Bit Toffoli Gates for IBM Quantum Computers Using the Bloch Sphere Approach and IBM Native Gates [0.0]
A cost-effective n-bit Toffoli gate is proposed to be realized (or transpiled) based on the layouts (linear, T-like, and I-like) and the number of n physical qubits for IBM quantum computers.
The layout-aware n-bit Toffoli gate is designed using the visual approach of the Bloch sphere.
After transpilation, our proposed layout-aware n-bit Toffoli gate always has a much lower transpilation quantum cost than that of the conventional n-bit Toffoli gate.
arXiv Detail & Related papers (2024-10-17T00:29:29Z) - Global Phase Helps in Quantum Search: Yet Another Look at the Welded Tree Problem [55.80819771134007]
In this paper, we give a short proof of the optimal linear hitting time for a welded tree problem by a discrete-time quantum walk.
The same technique can be applied to other 1-dimensional hierarchical graphs.
arXiv Detail & Related papers (2024-04-30T11:45:49Z) - Experimental realization of universal quantum gates and six-qubit state
using photonic quantum walk [2.331828779757202]
We report the experimental realize of universal set of quantum gates using photonic quantum walk.
We encode multiple qubits using polarization and paths degree of freedom for photon and demonstrate realization of universal set of gates with 100% success probability.
This work marks a significant progress towards using photonic quantum walk for quantum computing.
arXiv Detail & Related papers (2024-03-11T12:32:22Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Monte Carlo Graph Search for Quantum Circuit Optimization [26.114550071165628]
This work proposes a quantum architecture search algorithm based on a Monte Carlo graph search and measures of importance sampling.
It is applicable to the optimization of gate order, both for discrete gates, as well as gates containing continuous variables.
arXiv Detail & Related papers (2023-07-14T14:01:25Z) - Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder.
Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
arXiv Detail & Related papers (2022-09-30T02:36:42Z) - A hybrid quantum image edge detector for the NISQ era [62.997667081978825]
We propose a hybrid method for quantum edge detection based on the idea of a quantum artificial neuron.
Our method can be practically implemented on quantum computers, especially on those of the current noisy intermediate-scale quantum era.
arXiv Detail & Related papers (2022-03-22T22:02:09Z) - Realization of a deterministic quantum Toffoli gate with a single photon [4.121840022679671]
Quantum controlled-logic gates, including controlled NOT gate and Toffoli gate, play critical roles in lots of quantum information processing schemes.
We design and experimentally demonstrate deterministic Toffoli gate by utilizing orbital-angular-momentum and polarization degrees of freedom of a single photon.
arXiv Detail & Related papers (2020-10-28T05:52:04Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.