Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furthermore, we provide the corresponding quantum circuits, together with three equivalent simplifications. In circumstances when we can exactly estimate the ratio of the number of solutions M and the searched space N, our method can improve the successful probability close to 100%. Furthermore, compared with DHA, our algorithm shows an advantage in complexity with large databases and in the gate complexity of constructing oracles. Experiments have been executed on an IBM superconducting processor with two qubits, and a practical problem of finding the minimum from Titanic passengers' age was numerically simulated. Both showed that our optimized maximum or minimum performs more efficiently compared with DHA. Our algorithm can serve as an important subroutine in various quantum algorithms which involves searching maximum or minimum.
Recently, various quantum computing and communication tasks have been implemented using IBM's superconductivity-based quantum computers which are available on the cloud. Here, we show that the circuits used in most of those works were not optimized and the use of the optimized circuits can considerably improve the possibility of observing unique features of quantum mechanics. Specifically, a systematic procedure is used here to obtain optimized circuits (circuits having reduced gate count and number of levels) for a large number of Clifford+T circuits which have already been implemented in the…
Variational quantum algorithms (VQAs) are the quantum analog of classical neural networks (NNs). A VQA consists of a parameterized quantum circuit (PQC) which is composed of multiple layers of ansatzes (simpler PQCs, which are an analogy of NN layers) that differ only in selections of parameters. Previous work has identified the alternating layered ansatz as potentially a new standard ansatz in near-term quantum computing. Indeed, shallow alternating layered VQAs are easy to implement and have been shown to be both trainable and expressive. In this work, we introduce a training algorithm with …
Optimized Compilation of Logical Clifford Circuits
Fraunhofer IIS, Fraunhofer Institute for Integrated Circuits IIS（弗劳恩霍夫集成电路研究所）；University of Würzburg（维尔茨堡大学）；Friedrich-Alexander-Universität Erlangen-Nürnberg（埃尔朗根-纽伦堡弗里德里希·阿历克西斯大学）
In this paper, we present Clifford+T gates based quantum circuit design of integer division having $n$ ancillary qubits. The proposed quantum circuit is based on restoring division algorithm. The proposed quantum circuit of integer division consists of (i) quantum circuitry of conditional addition operation, (ii) quantum circuitry of integer subtraction. To design ancillary and T-count optimized design of quantum integer division, the optimized quantum circuit design of integer conditional addition operation and integer subtraction are presented. The proposed quantum integer division circuitry…
We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is currently available in the literature. We provide a software tool for analytical and numerical study of the generated purification circuits, under customizable error models. These new purification protocols pave the way to practical implementations of modular quantum computers and quantum repeaters. Our approach is particularly attentive to the…
The fermionic SWAP network is a qubit routing sequence that can be used to efficiently execute the Quantum Approximate Optimization Algorithm (QAOA). Even with a minimally-connected topology on an n-qubit processor, this routing sequence enables O(n^2) operations to execute in O(n) steps. In this work, we optimize the execution of fermionic SWAP networks for QAOA through two techniques. First, we take advantage of an overcomplete set of native hardware operations [including 150 ns controlled-pi/2 phase gates with up to 99.67(1)% fidelity] in order to decompose the relevant quantum gates and SW…
The main objective of this paper is to improve the communication costs in distributed quantum circuits. To this end, we present a method for generating distributed quantum circuits from monolithic quantum circuits in such a way that communication between partitions of a distributed quantum circuit is minimized. Thus, the communication between distributed components is performed at a lower cost. Compared to existing works, our approach can effectively map a quantum circuit into an appropriate number of distributed components. Since teleportation is usually the protocol used to connect component…
Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits
QPerfect SAS（QPerfect公司）；European Center for Quantum Sciences（欧洲量子科学中心）；QuEra Computing Inc.（QuEra计算公司）；Massachusetts Institute of Technology（麻省理工学院）；University of Strasbourg（斯特拉斯堡大学）；CNRS（法国国家科学研究中心）
GHZ-Preserving Gates and Optimized Distillation Circuits
Department of Physics, University of Massachusetts Amherst（马萨诸塞大学阿默斯特分校物理系）；College of Information and Computer Sciences, University of Massachusetts Amherst（马萨诸塞大学阿默斯特分校信息与计算机科学学院）
Reversible circuits for modular multiplication $Cx$%$M$ with $x<M$ arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and circuit depth rather than actual values, producing fairly large circuits not optimized for specific $C$ and $M$ values. In this work, we develop such optimizations in a bottom-up fashion, starting with most convenient $C$ values. When zero-initialized ancilla registers are available, we reduce the search for compact circuits to a shortest-path problem. Some of our…
Adversarial learning represents a powerful technique for generating data statistics. Its successful implementation in quantum computational platforms is not straightforward due to limitations in connectivity, quantum operation fidelity, and limited access to the quantum processor for statistically relevant results. Constraining the number of quantum operations and providing a design with a low compilation cost, we propose a quantum generative adversarial network design that uses real Hilbert spaces as the framework for the generative model and a novel strategy to encode classical information i…
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wavefunctions can be represented with linear memory requirement which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work, we employ directly determined pair-natural orbitals within a basis-se…
In this paper we improve the layered implementation of arbitrary stabilizer circuits introduced by Aaronson and Gottesman in {\it Phys. Rev. A 70(052328)}, 2004. In particular, we reduce their 11-stage computation -H-C-P-C-P-C-H-P-C-P-C- into an 8-stage computation of the form -H-C-CZ-P-H-P-CZ-C-. We show arguments in support of using -CZ- stages over the -C- stages: not only the use of -CZ- stages allows a shorter layered expression, but -CZ- stages are simpler and appear to be easier to implement compared to the -C- stages. Relying on the 8-stage decomposition we develop a two-qubit depth-$(…
In this paper, simultaneous reduction of circuit depth and synthesis cost of reversible circuits in quantum technologies with limited interaction is addressed. We developed a cycle-based synthesis algorithm which uses negative controls and limited distance between gate lines. To improve circuit depth, a new parallel structure is introduced in which before synthesis a set of disjoint cycles are extracted from the input specification and distributed into some subsets. The cycles of each subset are synthesized independently on different sets of ancillae. Accordingly, each disjoint set can be synt…
Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware. Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise. The tradeoff of gaining fault tolerance from using Clifford+T gates and error correcting codes is the high implementation overhead of the T gate. As a result, the T-count performance measure has become important in quantum circuit design. Due to noise, the risk for errors in a quantum circuit computation increases as the number of gate layers (or depth) in the circuit increases. As a result,…
Quantum circuits for basic image processing functions such as bilinear interpolation are required to implement image processing algorithms on quantum computers. In this work, we propose quantum circuits for the bilinear interpolation of NEQR encoded images based on Clifford+T gates. Quantum circuits for the scale up operation and scale down operation are illustrated. The proposed quantum circuits are based on quantum Clifford+T gates and are optimized for T-count. Quantum circuits based on Clifford+T gates can be made fault tolerant but the T gate is very costly to implement. As a result, redu…
Nuclear magnetic resonance is a promising experimental approach to search for ultra-light axion-like dark matter. Searches such as the cosmic axion spin-precession experiments (CASPEr) are ultimately limited by quantum-mechanical noise sources, in particular, spin-projection noise. We discuss how such fundamental limits can potentially be reached. We consider a circuit model of a magnetic resonance experiment and quantify three noise sources: spin-projection noise, thermal noise, and amplifier noise. Calculation of the total noise spectrum takes into account the modification of the circuit imp…
We implement an ultrafast pulsed type-II parametric down conversion source in a periodically poled KTP waveguide at telecommunication wavelengths with almost identical properties between signal and idler. As such, our source resembles closely a pure, genuine single mode photon pair source with indistinguishable modes. We measure the joint spectral intensity distribution and second order correlation functions of the marginal beams and find with both methods very low effective mode numbers corresponding to a Schmidt number below 1.16. We further demonstrate the indistinguishability as well as th…
Superconducting quantum circuits are potential candidates to realize a large-scale quantum computer. The envisioned large density of integrated components, however, requires a proper thermal management and control of dissipation. To this end, it is advantageous to utilize tunable dissipation channels and to exploit the optimized heat flow at exceptional points (EPs). Here, we experimentally realize an EP in a superconducting microwave circuit consisting of two resonators. The EP is a singularity point of the Hamiltonian, and corresponds to the most efficient heat transfer between the resonator…
Quantum circuits for basic mathematical functions such as the square root are required to implement scientific computing algorithms on quantum computers. Quantum circuits that are based on Clifford+T gates can easily be made fault tolerant but the T gate is very costly to implement. As a result, reducing T-count has become an important optimization goal. Further, quantum circuits with many qubits are difficult to realize, making designs that save qubits and produce no garbage outputs desirable. In this work, we present a T-count optimized quantum square root circuit with only $2 \cdot n +1$ qu…
We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for over-determined and under-determined cases. Our input model is such that the columns or rows of the matrix defining the linear system are given via quantum circuits of poly-logarithmic depth and the number of circuits is much smaller than their Hilbert space dimension. Our algorithms have poly-logarithmic dependence on the dimension and polynomial dependence in other natu…
Robust multi-mode superconducting circuit optimized for quantum information processing
University of the Basque Country UPV/EHU（巴斯克大学）；EHU Quantum Center, University of the Basque Country UPV/EHU（巴斯克大学 EHU 量子中心）；Forschungszentrum Jülich GmbH, Peter Grünberg Institute, Quantum Control (PGI-8)（于利希研究中心有限公司，彼得·格林伯格研究所，量子控制部门）；Walther-Meißner-Institut, Bayerische Akademie der Wissenschaften（瓦尔特·迈斯纳研究所，巴伐利亚科学院）；Technical University of Munich, TUM School of Natural Sciences, Department of Physics（慕尼黑工业大学，自然科学学院，物理系）；Departamento de Física, CEDENNA, Universidad de Santiago de Chile（圣地亚哥德智利大学，CEDENNA，物理系）；Institute for Theoretical Physics, University of Cologne（科隆大学，理论物理研究所）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与技术中心）
Exact quantum algorithm for searching of multiple sets intersection
School of Mathematical Sciences, Hangzhou Dianzi University（杭州电子科技大学数学科学学院）；School of Computer and Computing Science, Hangzhou City University（杭州城市大学计算机与计算科学学院）
We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how …
Von Neumann projections are the main operations by which information can be extracted from the quantum to the classical realm. They are however static processes that do not adapt to the states they measure. Advances in the field of adaptive measurement have shown that this limitation can be overcome by "wrapping" the von Neumann projectors in a higher-dimensional circuit which exploits the interplay between measurement outcomes and measurement settings. Unfortunately, the design of adaptive measurement has often been ad hoc and setup-specific. We shall here develop a unified framework for desi…
We propose a modification to Nielsen's circuit complexity for Hamiltonian simulation using the Suzuki-Trotter (ST) method, which provides a network like structure for the quantum circuit. This leads to an optimized gate counting linear in the geodesic distance and spatial volume, unlike in the original proposal. The optimized ST iteration order is correlated with the error tolerance and plays the role of an anti-de Sitter (AdS) radial coordinate. The density of gates is shown to be monotonic with the tolerance and a holographic interpretation using path-integral optimization is given.
Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices. Therefore, investigating their design has become key in quantum computing research. Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for VQAs is crucial to their overall performance, especially on near-term devices. In this paper, we utilize pulse-level access to quantum machines and our understanding of their two-qubit interactions to optimize the design of two-qubit entanglers in a manner suitable for VQAs. O…
A CNOT circuit is the key gadget for entangling qubits in quantum computing systems. However, the qubit connectivity of noisy intermediate-scale quantum (NISQ) devices is constrained by their {limited connectivity architecture}. To improve the performance of CNOT circuits on NISQ devices, we investigate the optimization of the size/depth of CNOT circuits under the limited connectivity architecture. We present a method that can optimize the size of any $n$-qubit CNOT circuit $O\left(\frac{n^2}{\log δ}\right)$ on any connected graph with minimum degree $δ$, and prove this bound is optimal for th…
