Results 51 to 60 of about 50,560 (159)

Implementation of Classic Image Transformation Algorithm to Quantum State, Boundary Extraction and Transformation of Half-Tone Image to Binary

Cybernetics and Information Technologies, 2020
The aim of the research is computer simulation of a quantum algorithm to solve the problem of transforming a classical image using quantum computing tools and methods, studying recognition algorithms and creating a recognition model using quantum methods.
Gushanskiy Sergey, Potapov Viktor, Madrigal Omar Correa   +2 more
doaj   +1 more source

Measuring the Tangle of Three-Qubit States

Entropy, 2020
We present a quantum circuit that transforms an unknown three-qubit state into its canonical form, up to relative phases, given many copies of the original state.
Adrián Pérez-Salinas, Diego García-Martín, Carlos Bravo-Prieto, José I. Latorre   +3 more
doaj   +1 more source

Quantum Computers and Quantum Algorithms. Part 2. Quantum Algorithms

Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics, 2016
The paper discusses principles of construction for quantum algorithms and their main features. Distinction of quantum parallelism from classical methods of high-performance computing is shown. Quantum algorithms design strategy is presented based on quantum circuits.
openaire   +1 more source

Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers

IEEE Transactions on Quantum Engineering
Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.
Vahideh Eshaghian, Soren Wilkening, Johan Aberg, David Gross   +3 more
doaj   +1 more source

Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators

IEEE Access
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit.
Natt Luangsirapornchai, Peeranat Sanglaor, Apimuk Sornsaeng, Stephane Bressan, Thiparat Chotibut, Kamonluk Suksen, Prabhas Chongstitvatana   +6 more
doaj   +1 more source

Efficient Quantum Answer Set Programming Solver Using Partial Diffusion and Entanglement

IEEE Access
The relation between answer set programming (ASP) and combinatorial problems, especially the satisfiability problem (SAT), has attracted significant interest in the academic literature.
Esraa Ebdelrehime, Ahmed Younes, Islam Elkabani   +2 more
doaj   +1 more source

Simulation of Quantum Discrete Cosine Transform for Grayscale Image Compression Using Qiskit

IEEE Access
The Discrete Cosine Transform (DCT) is an integral part of classical image compression, which becomes the basis of the JPEG standard. With advances in quantum computing, there is growing interest in exploring quantum analogues of classical algorithms for
Felix Montalfu, Seham Al Abdul Wahid, Farah Mohammadi, Arghavan Asad   +3 more
doaj   +1 more source

Quantum optimization algorithm based on multistep quantum computation

New Journal of Physics
We present a quantum algorithm for finding the minimum of a function based on multistep quantum computation, and apply the algorithm for solving optimization problems with continuous variables.
Hefeng Wang, Hua Xiang
doaj   +1 more source

A Survey on Available Tools and Technologies Enabling Quantum Computing

IEEE Access
In the contemporary era of scientific and technical innovations, we are witnessing remarkable progress in the realm of quantum computing. Today’s phase is referred to as the second quantum revolution, characterized by ongoing research and progress
Prateek Singh, Ritangshu Dasgupta, Anushka Singh, Harsh Pandey, Vikas Hassija, Vinay Chamola, Biplab Sikdar   +6 more
doaj   +1 more source

Quantum Algorithms for the Multiplication of Circulant Matrices and Vectors

Information
This article presents two quantum algorithms for computing the product of a circulant matrix and a vector. The arithmetic complexity of the first algorithm is O(Nlog2N) in most cases. For the second algorithm, when the entries in the circulant matrix and
Lu Hou, Zhenyu Huang, Chang Lv
doaj   +1 more source