Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0304085 · International Journal of Quantum Information

The Semi-Quantum Computer

Reinaldo O. Vianna, WILSON Ricardo Matos Rabelo, Carlos Henrique Monken

Published Jun 1, 2003• 1 citation
arXivHTMLPDF

Abstract

We discuss the performance of the Search and Fourier Transform algorithms on a hybrid computer constituted of classical and quantum processors working together. We show that this semi-quantum computer would be an improvement over a pure classical architecture, no matter how few qubits are available and, therefore, it suggests an easier implementable technology than a pure quantum computer with arbitrary number of qubits.

DOI
10.1142/s021974990300019x

Related papers

A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches

Ahmed Younes, Jon Rowe, Julian Francis Miller

In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid quantum search engine that integrates Grover's algorithm and the proposed algorithm here to have general performance better that any pure classical or quantum search algorithm.

arXiv:quant-ph/0311171•Nov 25, 2003•9 citations

Algoritmos para a informação quântica: discriminação de estados quânticos e modelo híbrido

WILSON Ricardo Matos Rabelo

In this thesis we consider a protocol to perform the optimal quantum state discrimination of N linearly independent non-orthogonal pure quantum states. This protocol obtains the best set of generalized measurements for the problem of the unambiguous state discrimination. Through the extension of the Hilbert space, it is possible to perform an unitary operation yielding a final configuration, which gives the best discrimination. We introduce a detailed mathematical procedure to realize this task by means of semidefinite programming and norm minimization. The former is used to fix which is the best detection conclusive probability amplitude for each quantum state of the ensemble. The latter determines the matrix which leads the input states to the final configuration. In a final step, we decompose the unitary transformation in a sequence of 1-qubit rotation matrices. Subsequently, we show applications of the protocol in the quantum cryptography and state filtering, and present a computational code in MATLAB. Our additional result deals with the computational hybrid models. In particular, we study the Semi-quantum Computer. We discuss the performance of the Search and Fourier Transform algorithms on a hybrid architecture constituted of classical and quantum processors working together. We show that the semi-quantum computer can reach an improvement over a pure classical architecture, no matter how few qubits are available and, therefore, it suggests an easier implementable technology.

•Nov 24, 2006•1 citation

Hybrid Quantum-classical Search Algorithms

Ansis Rosmanis

Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover’s algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum computation is required to achieve these speedups, the existing bounds do not rule out the possibility of an equally fast hybrid quantum-classical algorithm where most of the computation is classical. In this work, we study such hybrid algorithms, and we show that classical computation, unless it by itself can solve the Search problem, cannot assist quantum computation. In addition, we generalize this result to algorithms with subconstant success probabilities.

arXiv:2202.11443•ACM Transactions on Quantum Computing•Feb 16, 2024•23 citations

A programmable two-qubit solid-state quantum processor under ambient conditions

Yang Wu, Ya Wang, Xi Qin +2 more

Abstract Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programmable quantum processor under ambient conditions remains elusive. Here we report a programable quantum processor that can be programmed with fifteen parameters to realize arbitrary unitary transformations on two spin qubits in a nitrogen-vacancy (NV) center in diamond. We implemented the Deutsch-Jozsa and Grover search algorithms with average success rates above 80%. The results pave the way to implement the programmable method in a large-scale quantum processor.

arXiv:1808.05733•npj Quantum Information•Jan 25, 2019•68 citations

Integration of Quantum & Classical Processors for Hybrid Computing

Aiman Lameseha, Ashraf Uddin

Computers are changing swiftly, which has brought us to a new era where the flaws with classical computing are becoming clearer and clearer. Problems are getting so hard that even the most powerful regular supercomputers can't solve them. This is true in fields like cryptography, drug development, materials research, and logistics optimisation. Quantum computing might be a good choice because it can execute a lot of calculations at once using quantum effects like superposition and entanglement. However, modern quantum systems, which are frequently called Noisy Intermediate-Scale Quantum (NISQ) devices, have a lot of issues, like not having enough qubits, having short coherence times, and making a lot of mistakes. Because of these issues, it will be hard to construct fully functional, stand-alone quantum computers in the near future. Hybrid computing models are a smart solution to bridge the gap between traditional and quantum capabilities. These models use both quantum and regular processors in a way that lets them work together, with each part doing the job it is best at. In a typical hybrid system, classical processors are in charge of optimising routines, data preprocessing, and control flow. Quantum processors, on the other hand, handle some computational subroutines that perform better when quantum speedup is used. This integration makes it easy to create and apply valuable quantum algorithms like the Quantum Approximate Optimisation Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). These algorithms need quantum circuits and classical optimisers to operate together again and over again. This article goes into great detail about how quantum and classical computers can work together to make hybrid computing. It looks at several types of architecture, like co-located and cloud-based systems, and investigates the communication frameworks, software development kits (SDKs), and orchestration layers that make these function. Quantum machine learning, cryptography, and optimisation are some of the most important areas where hybrid systems could be used in the actual world. The report also talks about the issues that come up with latency, making sure software works with other software, scaling, and lowering errors. The hybrid method is more than simply a quick fix; it's a model for how computers will work in the future. It helps developers, scientists, and others in the field test quantum algorithms on current infrastructure as they wait for better quantum systems to come out. As quantum hardware and software ecosystems change, hybrid computing will be a big part of the future of high-performance, quantum-accelerated computing.

International Journal of Quantum Computing and Artificial Intelligence (IJQCAI)•Dec 15, 2025•0 citations

Revisiting Shor's quantum algorithm for computing general discrete logarithms

Martin Ekerå

We heuristically show that Shor's algorithm for computing general discrete logarithms achieves an expected success probability of approximately 60% to 82% in a single run when modified to enable efficient implementation with the semi-classical Fourier transform. By slightly increasing the number of group operations that are evaluated quantumly and performing a single limited search in the classical post-processing, or by performing two limited searches in the post-processing, we show how the algorithm can be further modified to achieve a success probability that heuristically exceeds 99% in a single run. We provide concrete heuristic estimates of the success probability of the modified algorithm, as a function of the group order $r$, the size of the search space in the classical post-processing, and the additional number of group operations evaluated quantumly. In the limit as $r \rightarrow \infty$, we heuristically show that the success probability tends to one. In analogy with our earlier works, we show how the modified quantum algorithm may be heuristically simulated classically when the logarithm $d$ and $r$ are both known. Furthermore, we heuristically show how slightly better tradeoffs may be achieved, compared to our earlier works, if $r$ is known when computing $d$. We generalize our heuristic to cover some of our earlier works, and compare it to the non-heuristic analyses in those works.

arXiv:1905.09084•May 22, 2019•29 citations
We discuss the performance of the Search and Fourier Transform algorithms on a hybrid computer constituted of classical and quantum processors working together. We show that this semi-quantum computer would be an improvement over a pure classical architecture, no matter how few qubits are available and, therefore, it suggests an easier implementable technology than a pure quantum computer with arbitrary number of qubits.
In this thesis we consider a protocol to perform the optimal quantum state discrimination of N linearly independent non-orthogonal pure quantum states. This protocol obtains the best set of generalized measurements for the problem of the unambiguous state discrimination. Through the extension of the Hilbert space, it is possible to perform an unitary operation yielding a final configuration, which gives the best discrimination. We introduce a detailed mathematical procedure to realize this task by means of semidefinite programming and norm minimization. The former is used to fix which is the best detection conclusive probability amplitude for each quantum state of the ensemble. The latter determines the matrix which leads the input states to the final configuration. In a final step, we decompose the unitary transformation in a sequence of 1-qubit rotation matrices. Subsequently, we show applications of the protocol in the quantum cryptography and state filtering, and present a computational code in MATLAB. Our additional result deals with the computational hybrid models. In particular, we study the Semi-quantum Computer. We discuss the performance of the Search and Fourier Transform algorithms on a hybrid architecture constituted of classical and quantum processors working together. We show that the semi-quantum computer can reach an improvement over a pure classical architecture, no matter how few qubits are available and, therefore, it suggests an easier implementable technology.
Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover’s algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum computation is required to achieve these speedups, the existing bounds do not rule out the possibility of an equally fast hybrid quantum-classical algorithm where most of the computation is classical. In this work, we study such hybrid algorithms, and we show that classical computation, unless it by itself can solve the Search problem, cannot assist quantum computation. In addition, we generalize this result to algorithms with subconstant success probabilities.
Abstract Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized state of qubits, which coherently evolves into a final state containing the result of the computation. Although quantum processors with a few qubits have been demonstrated on multiple quantum computing platforms, realization of solid-state programmable quantum processor under ambient conditions remains elusive. Here we report a programable quantum processor that can be programmed with fifteen parameters to realize arbitrary unitary transformations on two spin qubits in a nitrogen-vacancy (NV) center in diamond. We implemented the Deutsch-Jozsa and Grover search algorithms with average success rates above 80%. The results pave the way to implement the programmable method in a large-scale quantum processor.
Computers are changing swiftly, which has brought us to a new era where the flaws with classical computing are becoming clearer and clearer. Problems are getting so hard that even the most powerful regular supercomputers can't solve them. This is true in fields like cryptography, drug development, materials research, and logistics optimisation. Quantum computing might be a good choice because it can execute a lot of calculations at once using quantum effects like superposition and entanglement. However, modern quantum systems, which are frequently called Noisy Intermediate-Scale Quantum (NISQ) devices, have a lot of issues, like not having enough qubits, having short coherence times, and making a lot of mistakes. Because of these issues, it will be hard to construct fully functional, stand-alone quantum computers in the near future. Hybrid computing models are a smart solution to bridge the gap between traditional and quantum capabilities. These models use both quantum and regular processors in a way that lets them work together, with each part doing the job it is best at. In a typical hybrid system, classical processors are in charge of optimising routines, data preprocessing, and control flow. Quantum processors, on the other hand, handle some computational subroutines that perform better when quantum speedup is used. This integration makes it easy to create and apply valuable quantum algorithms like the Quantum Approximate Optimisation Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). These algorithms need quantum circuits and classical optimisers to operate together again and over again. This article goes into great detail about how quantum and classical computers can work together to make hybrid computing. It looks at several types of architecture, like co-located and cloud-based systems, and investigates the communication frameworks, software development kits (SDKs), and orchestration layers that make these function. Quantum machine learning, cryptography, and optimisation are some of the most important areas where hybrid systems could be used in the actual world. The report also talks about the issues that come up with latency, making sure software works with other software, scaling, and lowering errors. The hybrid method is more than simply a quick fix; it's a model for how computers will work in the future. It helps developers, scientists, and others in the field test quantum algorithms on current infrastructure as they wait for better quantum systems to come out. As quantum hardware and software ecosystems change, hybrid computing will be a big part of the future of high-performance, quantum-accelerated computing.
We heuristically show that Shor's algorithm for computing general discrete logarithms achieves an expected success probability of approximately 60% to 82% in a single run when modified to enable efficient implementation with the semi-classical Fourier transform. By slightly increasing the number of group operations that are evaluated quantumly and performing a single limited search in the classical post-processing, or by performing two limited searches in the post-processing, we show how the algorithm can be further modified to achieve a success probability that heuristically exceeds 99% in a single run. We provide concrete heuristic estimates of the success probability of the modified algorithm, as a function of the group order rrr, the size of the search space in the classical post-processing, and the additional number of group operations evaluated quantumly. In the limit as r→∞r \rightarrow \inftyr→∞, we heuristically show that the success probability tends to one. In analogy with our earlier works, we show how the modified quantum algorithm may be heuristically simulated classically when the logarithm ddd and rrr are both known. Furthermore, we heuristically show how slightly better tradeoffs may be achieved, compared to our earlier works, if rrr is known when computing ddd. We generalize our heuristic to cover some of our earlier works, and compare it to the non-heuristic analyses in those works.