An universal quantum network which can implement a general quantum computing is proposed. In this sense, it can be called the quantum central processing unit (QCPU). For a given quantum computing, its realization of QCPU is just its quantum network. QCPU is standard and easy-assemble because it only has two kinds of basic elements and two auxiliary elements. QCPU and its realizations are scalable, that is, they can be connected together, and so they can construct the whole quantum network to implement the general quantum algorithm and quantum simulating procedure.
A CPU+DCU Heterogeneous Parallel Framework for Post-Processing Reconstruction in Quantum Circuit Cutting
National Supercomputing Center in Zhengzhou, Zhengzhou University（国家超级计算郑州中心，郑州大学）；School of Computer and Artificial Intelligence, Zhengzhou University（郑州大学计算机与人工智能学院）；Nanjing Institute of Technology（南京工程学院）
As we enter the era of useful quantum computers we need to better understand the limitations of classical support hardware, and develop mitigation techniques to ensure effective qubit utilisation. In this paper we discuss three key bottlenecks in near-term quantum computers: bandwidth restrictions arising from data transfer between central processing units (CPUs) and quantum processing units (QPUs), latency delays in the hardware for round-trip communication, and timing restrictions driven by high error rates. In each case we consider a near-term quantum algorithm to highlight the bottleneck: …
Python is a popular programming language known for its flexibility, usability, readability, and focus on developer productivity. The quantum software community has adopted Python on a number of large-scale efforts due to these characteristics, as well as the remote nature of near-term quantum processors. The use of Python has enabled quick prototyping for quantum code that directly benefits pertinent research and development efforts in quantum scientific computing. However, this rapid prototyping ability comes at the cost of future performant integration for tightly-coupled CPU-QPU architectur…
Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both inform…
Teleportation scheme implementing contextually the Universal Optimal Quantum Cloning Machine and the Universal Not Gate. Complete experimental realization
Universal quantum computation is usually associated with interaction among two-level quantum subsystems, as this interaction is commonly viewed as a necessity to achieve universal quantum computation. In this work, we show that, contrary to this intuition, universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. We call it counterfactual universal quantum computation. As special cases, we show how to achieve counterfactual communication of quantum states, counterfactual quantum swapping, and counterfactual quantum erasure codes…
This paper deduces universal uncertainty principle in different quantum theories after about one century of proposing uncertainty principle by Heisenberg, i.e., new universal uncertainty principle of any orders of physical quantities in quantum physics, overcomes the difficulty that current quantum computer, quantum communication, quantum control, quantum mechanics and so on theories cannot give exact values of general uncertainty of any orders of physical quantities, further gives all relevant different expressions of the universal uncertainty principle and their applications. In fact, our st…
We provide the first example of a symmetry protected quantum phase that has universal computational power. Throughout this phase, which lives in spatial dimension two, the ground state is a universal resource for measurement based quantum computation.
Quantum information is a useful resource to set up information processing. Despite physical components are normally two-level systems, their combination with entangling interactions becomes in a complex dynamics. Studied for piecewise field pulses, this work analyzes the modeling for quantum information operations with fields affordable technologically towards a universal quantum computation model.
Recent work has demonstrated the existence of universal Hamiltonians - simple spin lattice models that can simulate any other quantum many body system to any desired level of accuracy. Until now proofs of universality have relied on explicit constructions, tailored to each specific family of universal Hamiltonians. In this work we go beyond this approach, and completely classify the simulation ability of quantum Hamiltonians by their complexity classes. We do this by deriving necessary and sufficient complexity theoretic conditions characterising universal quantum Hamiltonians. Although the re…
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires $X$ and $Z$-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only $X$ and $Z$-bas…
