Quantum multi-programming for Grover’s search
- Brookhaven National Laboratory (BNL), Upton, NY (United States)
- Stony Brook University, NY (United States)
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. So, the empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.
- Research Organization:
- Brookhaven National Laboratory (BNL), Upton, NY (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); National Energy Research Scientific Computing Center (NERSC); Microsoft Azure Quantum
- Grant/Contract Number:
- SC0012704; AC05-00OR22725; AC02-05CH11231
- OSTI ID:
- 1924191
- Report Number(s):
- BNL-223958-2023-JAAM
- Journal Information:
- Quantum Information Processing, Journal Name: Quantum Information Processing Journal Issue: 1 Vol. 22; ISSN 1570-0755
- Publisher:
- SpringerCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
NISQ Benchmarking
Using Grover’s search protocol to select the best qubit pairs