GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2022
    In:  Quantum Information Processing Vol. 21, No. 5 ( 2022-05)
    In: Quantum Information Processing, Springer Science and Business Media LLC, Vol. 21, No. 5 ( 2022-05)
    Type of Medium: Online Resource
    ISSN: 1573-1332
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2022
    detail.hit.zdb_id: 2088114-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Wiley ; 2023
    In:  Advanced Intelligent Systems Vol. 5, No. 3 ( 2023-03)
    In: Advanced Intelligent Systems, Wiley, Vol. 5, No. 3 ( 2023-03)
    Abstract: Compared with classical algorithms, quantum algorithms can show the advantage of exponential speedup in solving some problems. Solving the NAND‐Tree problem is a typical example, which can be speed up exponentially by quantum walk. This scheme is groundbreaking due to the universality of the negative‐AND (NAND) gate. In fact, the NAND gate is also universal for classical computation, making it an important target for development. Herein, the quantum NAND‐Tree onto the classical circuit network is mapped and a new type of classical logic circuit with the NAND gate that can perform the quantum algorithms is designed. These classical logic gates that are designed have exponential speedup functions compared with conventional ones. Because classical circuit networks possess good scalability and stability, the present scheme is expected to have potential applications for information processing in the era of big data.
    Type of Medium: Online Resource
    ISSN: 2640-4567 , 2640-4567
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2023
    detail.hit.zdb_id: 2975566-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Wiley ; 2022
    In:  Advanced Quantum Technologies Vol. 5, No. 4 ( 2022-04)
    In: Advanced Quantum Technologies, Wiley, Vol. 5, No. 4 ( 2022-04)
    Abstract: 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.
    Type of Medium: Online Resource
    ISSN: 2511-9044 , 2511-9044
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2022
    detail.hit.zdb_id: 2885525-5
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    IOP Publishing ; 2022
    In:  Chinese Physics B Vol. 31, No. 7 ( 2022-06-01), p. 070504-
    In: Chinese Physics B, IOP Publishing, Vol. 31, No. 7 ( 2022-06-01), p. 070504-
    Abstract: The quantum search on the graph is a very important topic. In this work, we develop a theoretic method on searching of single vertex on the graph [ Phys. Rev. Lett. 114 110503 (2015)], and systematically study the search of many vertices on one low-connectivity graph, the joined complete graph. Our results reveal that, with the optimal jumping rate obtained from the theoretical method, we can find such target vertices at the time O ( N ) , where N is the number of total vertices. Therefore, the search of many vertices on the joined complete graph possessing quantum advantage has been achieved.
    Type of Medium: Online Resource
    ISSN: 1674-1056
    Language: Unknown
    Publisher: IOP Publishing
    Publication Date: 2022
    detail.hit.zdb_id: 2412147-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    In: Advanced Science, Wiley, Vol. 10, No. 19 ( 2023-07)
    Abstract: Electronic sensors play important roles in various applications, such as industry and environmental monitoring, biomedical sample ingredient analysis, wireless networks and so on. However, the sensitivity and robustness of current schemes are often limited by the low quality‐factors of resonators and fabrication disorders. Hence, exploring new mechanisms of the electronic sensor with a high‐level sensitivity and a strong robustness is of great significance. Here, a new way to design electronic sensors with superior performances based on exotic properties of non‐Hermitian topological physics is proposed. Owing to the extreme boundary‐sensitivity of non‐Hermitian topological zero modes, the frequency shift induced by boundary perturbations can show an exponential growth trend with respect to the size of non‐Hermitian topolectrical circuit sensors. Moreover, such an exponential growth sensitivity is also robust against disorders of circuit elements. Using designed non‐Hermitian topolectrical circuit sensors, the ultrasensitive identification of the distance, rotation angle, and liquid level is further experimentally verified with the designed capacitive devices. The proposed non‐Hermitian topolectrical circuit sensors can possess a wide range of applications in ultrasensitive environmental monitoring and show an exciting prospect for next‐generation sensing technologies.
    Type of Medium: Online Resource
    ISSN: 2198-3844 , 2198-3844
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2023
    detail.hit.zdb_id: 2808093-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    American Association for the Advancement of Science (AAAS) ; 2021
    In:  Research Vol. 2021 ( 2021-01)
    In: Research, American Association for the Advancement of Science (AAAS), Vol. 2021 ( 2021-01)
    Abstract: 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.
    Type of Medium: Online Resource
    ISSN: 2639-5274
    Language: English
    Publisher: American Association for the Advancement of Science (AAAS)
    Publication Date: 2021
    detail.hit.zdb_id: 2949955-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Wiley ; 2024
    In:  Advanced Quantum Technologies Vol. 7, No. 1 ( 2024-01)
    In: Advanced Quantum Technologies, Wiley, Vol. 7, No. 1 ( 2024-01)
    Abstract: Classical combinational logic circuits (CCLCs) are widely used in various fields. Corresponding to the CCLCs, here schemes are given for some quantum combinational logic circuits (QCLCs) based on the quantum NAND tree. Three typical circuits, adder, comparator, and seven‐segment display decoder, are discussed in detail as examples. All the designs of the schemes are based on the quantum random walk theory. Furthermore, these QCLCs are mapped onto the classical circuit networks and design new types of CCLCs, and take advantage of the fact that there is a good correspondence between the voltage in the circuit satisfying Kirchhoff's law and the system wave function satisfying the Schrodinger equation. These CCLCs that are designed have exponential speedup functions compared with conventional ones, which have been demonstrated experimentally. Because classical circuit networks possess good scalability and stability, the realization of QCLCs on classical circuits is expected to have potential applications for information processing in the era of big data.
    Type of Medium: Online Resource
    ISSN: 2511-9044 , 2511-9044
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2024
    detail.hit.zdb_id: 2885525-5
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    In: Advanced Quantum Technologies, Wiley, Vol. 5, No. 4 ( 2022-04)
    Type of Medium: Online Resource
    ISSN: 2511-9044 , 2511-9044
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2022
    detail.hit.zdb_id: 2885525-5
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Wiley ; 2023
    In:  Advanced Intelligent Systems Vol. 5, No. 11 ( 2023-11)
    In: Advanced Intelligent Systems, Wiley, Vol. 5, No. 11 ( 2023-11)
    Abstract: The key obstacle to the realization of a scalable quantum computer is overcoming environmental and control errors. Topological quantum computation attracts great attention because it emerges as one of the most promising approaches to solving these problems. Various theoretical schemes for building topological quantum computation have been proposed. However, experimental implementation has always been a great challenge because it has proved to be extremely difficult to create and manipulate topological qubits in real systems. Therefore, topological quantum computation has not been realized in experiments yet. Herein, the first experimental simulation of topological quantum computation with classical circuits is reported. Based on the proposed new scheme with circuits, not only Majorana‐like edge states are simulated experimentally, but also T junctions are constructed for simulating the braiding process. Furthermore, the feasibility of simulated topological quantum computing through a set of one‐ and two‐qubit unitary operations is demonstrated. Finally, the simulation of Grover's search algorithm demonstrates that simulated topological quantum computation is ideally suited for such tasks. The developed circuit‐based topological quantum‐computing simulator can provide important references for developing future topological quantum circuits.
    Type of Medium: Online Resource
    ISSN: 2640-4567 , 2640-4567
    URL: Issue
    Language: English
    Publisher: Wiley
    Publication Date: 2023
    detail.hit.zdb_id: 2975566-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...