This research focuses on the evolving field of hybrid computing, which combines traditional computing architectures with advanced computational paradigms like quantum computing, neuromorphic computing, or cloud-edge c...
详细信息
ISBN:
(纸本)9798331515911
This research focuses on the evolving field of hybrid computing, which combines traditional computing architectures with advanced computational paradigms like quantum computing, neuromorphic computing, or cloud-edge computing. Hybrid computing involves integrating multiple computing models or systems to leverage their complementary strengths. For example, combining classical computing with quantum or neuromorphic approaches to solve complex problems more efficiently. The goal is to enhance computational power, increase efficiency, and tackle problems that are difficult for traditional computing models alone. Emerging technologies, including quantum computing, machine learning, and AI, are driving the need for hybrid systems. These technologies enable the handling of more complex computations that classical systems struggle with, such as optimization, simulation, and cryptography. The integration of cloud and edge computing is also central to hybrid computing, enabling decentralized computation and processing closer to data sources. Combining different computing paradigms requires seamless communication and integration between systems, which is a significant technical challenge. Main challenging areas are scalability, software and hardware compatibility, energy efficiency and security. There is a need for standard protocols and frameworks to enable smoother integration of various computing systems. New algorithms that can take advantage of hybrid architectures need to be developed. Depend on applications significant advancements in hardware, including quantum processors, neuromorphic chips, and integrated hybrid processors required. The rise of hybrid computing will also bring ethical concerns, such as the impact on jobs, privacy, and inequality in access to advanced technologies. The study concludes by emphasizing the transformative potential of hybrid computing while acknowledging the technical, economic, and societal hurdles that need to be overcome. It highlights
Rydberg atom arrays have recently emerged as one of the most promising platforms for quantum simulation and quantuminformationprocessing. However, as is the case for other experimental platforms, the longer-term suc...
详细信息
Rydberg atom arrays have recently emerged as one of the most promising platforms for quantum simulation and quantuminformationprocessing. However, as is the case for other experimental platforms, the longer-term success of the Rydberg atom arrays in implementing quantumalgorithms depends crucially on their robustness to gate-induced errors. Here we show that, for an idealized biased-error model based on Rydberg atom dynamics, the implementation of quantum signal processing (QSP) protocols can be made error robust, in the sense that the asymptotic scaling of the gate-induced error probability is slower than that of gate complexity. Moreover, our numerical results that use experimentally accessible parameters indicate that QSP iterates made out of more than 100 gates can be implemented with constant error probability. To showcase our approach, we provide a concrete blueprint to implement QSP-based near-optimal Hamiltonian simulation on the Rydberg atom platform. The proposed protocol substantially improves both the scaling and the overhead of gate-induced errors in comparison to those protocols that implement a fourth-order product formula.
We use quantum computers to test the foundations of quantum mechanics through quantumalgorithms that implement some of the experimental tests as the basis of the theory's postulates. These algorithms can be used ...
详细信息
We use quantum computers to test the foundations of quantum mechanics through quantumalgorithms that implement some of the experimental tests as the basis of the theory's postulates. These algorithms can be used as a test of the physical theory under the premise of perfect hardware or as a test of the hardware under the premise that quantum theory is correct. In this work, we show how the algorithms can be used to test the efficacy of a quantum computer in obeying the postulates of quantum mechanics. We study the effect of different types of noise on the results of experimental tests of the postulates. A salient feature of this noise analysis is that it is deeply rooted in the fundamentals of quantum mechanics as it highlights how systematic errors affect the quantumness of the quantum computer.
Using the recent ability of quantum computers to initialize quantum states rapidly with high fidelity, we use a function operating on a discrete set to create a simple class of quantum channels. Fixed points and perio...
详细信息
Using the recent ability of quantum computers to initialize quantum states rapidly with high fidelity, we use a function operating on a discrete set to create a simple class of quantum channels. Fixed points and periodic orbits, that are present in the function, generate fixed points and periodic orbits in the associated quantum channel. Phenomenology such as periodic doubling is visible in a 6 qubit dephasing channel constructed from a truncated version of the logistic map. Using disjoint subsets, discrete function-generated channels can be constructed that preserve coherence within subspaces. Error correction procedures can be in this class as syndrome detection uses an initialized quantum register. A possible application for function-generated channels is in hybrid classical/quantumalgorithms. We illustrate how these channels can aid in carrying out classical computations involving iteration of non-invertible functions on a quantum computer with the Euclidean algorithm for finding the greatest common divisor of two integers.
In real life, interdependent networks are common and their robustness has received considerable attention. When an interdependent network is attacked, the failure may propagate along the links to the whole network. Am...
详细信息
We develop genetic algorithms for searching quantum circuits, in particular stabilizer quantum error correction codes. quantum codes equivalent to notable examples such as the 5-qubit perfect code, Shor's code and...
详细信息
We develop genetic algorithms for searching quantum circuits, in particular stabilizer quantum error correction codes. quantum codes equivalent to notable examples such as the 5-qubit perfect code, Shor's code and the 7-qubit color code are evolved out of initially random quantum circuits. We anticipate evolution as a promising tool in the NISQ era, with applications such as the search for novel topological ordered states, quantum compiling and hardware optimization.
We propose an improved quantum anonymous multiparty multidata ranking (QAMMR) protocol based on the binary search tree. In a QAMMR protocol, multiple participants get the ranking of their data without disclosing their...
详细信息
We propose an improved quantum anonymous multiparty multidata ranking (QAMMR) protocol based on the binary search tree. In a QAMMR protocol, multiple participants get the ranking of their data without disclosing their identity. It is done with the help of a semi-honest third party (TP), who may try to access others' data without deviating from the protocol. In existing algorithms, each participant will get to know the count of all data possessed by all participants by the end of the protocol. They are used to calculate the rank of each data each participant possesses. Our protocol achieves the same goal of finding rank with better security and fewer quantum particles. Our protocol determines the rank of a data by disclosing various ranges of data. We use substantially fewer quantum particles to make the protocol more efficient and practically feasible, especially when the range of the data is much higher than the total number of data. Further, we analyze the protocol and prove it is secure against internal and external attacks.
In the current noisy intermediate-scale quantum(NISQ)era,a single quantumprocessing unit(QPU)is insufficient to implement large-scale quantumalgorithms;this has driven extensive research into distributed quantum com...
详细信息
In the current noisy intermediate-scale quantum(NISQ)era,a single quantumprocessing unit(QPU)is insufficient to implement large-scale quantumalgorithms;this has driven extensive research into distributed quantum computing(DQC).DQC involves the cooperative operation of multiple QPUs but is concurrently challenged by excessive communication *** address this issue,this paper proposes a quantum circuit partitioning method based on spectral *** approach transforms quantum circuits into weighted graphs and,through computation of the Laplacian matrix and clustering techniques,identifies candidate partition schemes that minimize the total weight of the ***,a global gate search tree strategy is introduced to meticulously explore opportunities for merged transfer of global gates,thereby minimizing the transmission cost of distributed quantum circuits and selecting the optimal partition scheme from the ***,the proposed method is evaluated through various comparative *** experimental results demonstrate that spectral clustering-based partitioning exhibits robust stability and efficiency in runtime in quantum circuits of different *** experiments involving the quantum Fourier transform algorithm and Revlib quantum circuits,the transmission cost achieved by the global gate search tree strategy is significantly optimized.
Solid-state spin qubits is a promising platform for quantum computation and quantum networks(1,2). Recent experiments have demonstrated high-quality control over multi-qubit systems(3-8), elementary quantumalgorithms...
Solid-state spin qubits is a promising platform for quantum computation and quantum networks(1,2). Recent experiments have demonstrated high-quality control over multi-qubit systems(3-8), elementary quantumalgorithms(8-11) and non-fault-tolerant error correction(12-14). Large-scale systems will require using error-corrected logical qubits that are operated fault tolerantly, so that reliable computation becomes possible despite noisy operations(15-18). Overcoming imperfections in this way remains an important outstanding challenge for quantum science(15,19-27). Here, we demonstrate fault-tolerant operations on a logical qubit using spin qubits in diamond. Our approach is based on the five-qubit code with a recently discovered flag protocol that enables fault tolerance using a total of seven qubits(28-30).We encode the logical qubit using a new protocol based on repeated multi-qubit measurements and show that it outperforms non-fault-tolerant encoding schemes. We then fault-tolerantly manipulate the logical qubit through a complete set of single-qubit Clifford gates. Finally, we demonstrate flagged stabilizer measurements with real-time processing of the outcomes. Such measurements are a primitive for fault-tolerant quantum error correction. Although future improvements in fidelity and the number of qubits will be required to suppress logical error rates below the physical error rates, our realization of fault-tolerant protocols on the logical-qubit level is a key step towards quantuminformationprocessing based on solid-state spins.
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 *** has been implemented using various...
详细信息
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 *** has been implemented using various quantum ***,we demonstrate both theoretically and experimentally that such a fast search algorithm can also be realized using classical electric *** classical circuit networks to perform such a fast search have been *** 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 *** searching efficiencies in our designed classical circuits are the same to the quantum *** classical circuit networks possess good scalability and stability,the present scheme is expected to avoid some problems faced by the quantum ***,our findings are advantageous for informationprocessing in the era of big data.
暂无评论