相关论文: Modeling full adder in Ising spin quantum computer…
A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
We propose a novel scheme of solid state realization of a quantum computer based on single spin "enhancement mode" quantum dots as building blocks. In the enhancement quantum dots, just one electron can be brought into initially empty dot,…
As the first useful Quantum Computers will be quantum simulators, here the minimum number of qubits necessary for the solution of the Schroedinger equation in simple test problems is evaluated. From the present preliminary results it…
Hybrid quantum systems seek to combine the strength of its constituents to master the fundamental conflicting requirements of quantum technology: fast and accurate systems control together with perfect shielding from the environment,…
Recent demonstrations of superconducting quantum computers by Google and IBM and trapped-ion computers from IonQ fueled new research in quantum algorithms, compilation into quantum circuits, and empirical algorithmics. While online access…
The quantum circuit model is an abstraction that hides the underlying physical implementation of gates and measurements on a quantum computer. For precise control of real quantum hardware, the ability to execute pulse and readout-level…
Hybrid quantum systems combine the unique advantages of different physical platforms with the goal of realizing more powerful and practical quantum information processing devices. Mechanical systems, such as bulk acoustic wave resonators,…
Practical quantum computers require the construction of a large network of highly coherent qubits, interconnected in a design robust against errors. Donor spins in silicon provide state-of-the-art coherence and quantum gate fidelities, in a…
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state…
The implementation of a universal quantum processor still poses fundamental issues related to error mitigation and correction, which demand to investigate also platforms and computing schemes alternative to the main stream. A possibility is…
A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor's algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3-5],…
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…
We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…
Frequently, subroutines in quantum computers have the structure $\mathcal{F}\mathcal{U}\mathcal{F}^{-1}$, where $\mathcal{F}$ is some unitary transform and $\mathcal{U}$ is performing a quantum computation. In this paper we suggest that if,…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…