Quantum search algorithm, which can search an unsorted database quadratically faster than any known classical algorithms, has become one of the most impressive showcases of quantum computation. It has been implemented using various quantum schemes. Here, we demonstrate both theoretically and experimentally that such a fast search algorithm can also be realized using classical electric circuits. The classical circuit networks to perform such a fast search have been designed. It has been shown that the evolution of electric signals in the circuit networks is analogies of quantum particles randomly walking on graphs described by quantum theory. The searching efficiencies in our designed classical circuits are the same to the quantum schemes. Because classical circuit networks possess good scalability and stability, the present scheme is expected to avoid some problems faced by the quantum schemes. Thus, our findings are advantageous for information processing in the era of big data.

The ultimate goal of developing quantum algorithms and constructing quantum computers is to achieve faster information processing than using current classical computers. Quantum walks are powerful kernels in quantum computing protocols and possess strong capabilities in speeding up various simulation and optimization tasks. One striking example is provided by quantum walkers evolving on unbalanced trees, which demonstrate faster hitting performances than classical random walk. However, direct experimental construction of unbalanced trees to prove quantum advantage with exponential speedup remains a great challenge due to the highly complex arrangements of the structure. This study attempts to simulate quantum algorithm by classical circuit. Inspired by the quantum algorithm, the classical circuit networks are designed and fabricated with unbalanced tree structures. It is then demonstrated, both theoretically and experimentally, that the quantum algorithm for the fast hitting problem can be simulated in the structure. It is shown that the hitting efficiency of electric signals in the circuit networks with unbalanced tree structures is exponentially faster than the corresponding cases of classical random walks. Because classical circuit networks possess good scalability and stability, the results open up a scalable new path toward quantum speedup in complex problems.

Exploring novel topological phases of matter is one of the most fascinating research areas because they support some of the most fascinating properties for robust signal transports and wave propagations. Recently, higher-order topological insulators (HOTIs) have been introduced, and were shown to host topological corner states under the theoretical framework of Benalcazar-Bernevig-Hughes (BBH). Here we unveil some novel topological effects in HOTIs by studying the three-dimensional (3D) non-Abelian Bloch oscillations (BOs). In HOTIs, BOs with a multiplied period occur when a force with a special direction is applied due to the effect of the non-Abelian Berry curvature. Along the direction of the oscillations we find a novel higher-order topological state that goes beyond the theoretical framework of BBH. The emergence of such a higher-order topological state coincides with the appearance of the 3D non-Abelian BOs. That is, the 3D non-Abelian BOs can be used as a tool to probe novel higher-order topological states. The phenomena including the 3D non-Abelian BOs and the novel topological states are observed experimentally with designed electric circuit networks. Our work opens up a new way to detect novel topological phases theoretically and experimentally.

No abstract

No abstract