Fig. 3: Two-solution Grover search on a database of size N = 23. | Nature Communications

Fig. 3: Two-solution Grover search on a database of size N = 23.

From: Demonstration of measurement-free universal logical quantum computation

Fig. 3: Two-solution Grover search on a database of size N = 23.

a We recompile the Grover search algorithm that includes a phase oracle55,62 into the available FT gate operations within one [[8, 3, 2]]-code {HL, CNOTL, CCZL}. b Experimentally obtained (dark) and numerically simulated (light) probabilities for each possible solution. The two solutions 011 and 101 can be clearly distinguished, and the total probability to find one of the two solutions (green) is psuccess = p011 + p101 = 0.40(4).

Back to article page