There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ($>$ 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.
The ability of implementing quantum operations plays fundamental role in manipulating quantum systems. Creation and annihilation operators which transform a quantum state to another by adding or subtracting a particle are crucial of constructing quantum description of many body quantum theory and quantum field theory. Here we present a quantum algorithm to perform them by the linear combination of unitary operations associated with a two-qubit ancillary system. Our method can realize creation and annihilation operators simultaneously in the subspace of the whole system. A prototypical experime…
The efficient simulation of quantum systems is a primary motivating factor for developing controllable quantum machines. For addressing systems with underlying bosonic structure, it is advantageous to utilize a naturally bosonic platform. Optical photons passing through linear networks may be configured to perform quantum simulation tasks, but the efficient preparation and detection of multiphoton quantum states of light in linear optical systems are challenging. Here, we experimentally implement a boson sampling protocol for simulating molecular vibronic spectra [Nature Photonics $\textbf{9}$…
Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum and CMOS annealing processors. While recent embedding heuristics have been developed for annealers of moderate size (about 2000 nodes) the size of the latest CMOS annealing processor (with 102,400 nodes) poses entirely new demands on the embedding heuristic. This raises the question, if recent embedding heuristics can maintain meaningful embedding performance on hardware graphs of increasing size. Here, we develop an i…
Quantum processors enable computational speedups for machine learning through parallel manipulation of high-dimensional vectors. Early demonstrations of quantum machine learning have focused on processing information with qubits. In such systems, a larger computational space is provided by the collective space of multiple physical qubits. Alternatively, we can encode and process information in the infinite-dimensional Hilbert space of bosonic systems such as quantum harmonic oscillators. This approach offers a hardware-efficient solution with potential quantum speedups to practical machine lea…
Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the heuristic ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability, which may lead to the degraded performance when executed on the noisy intermediate-scale quantum (NISQ) machines. To address this issue, here we demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique, i.e., quantum architecture search…
Advancements in computing based on qubit networks, and in particular the flux-qubit processor architecture developed by D-Wave System's Inc., have enabled the physical simulation of quantum-dot cellular automata (QCA) networks beyond the limit of classical methods. However, the embedding of QCA networks onto the available processor architecture is a key challenge in preparing such simulations. In this work, two approaches to embedding QCA circuits are characterized: a dense placement algorithm that uses a routing method based on negotiated congestion; and a heuristic method implemented in D-Wa…
Continuous-variable (CV) encoding allows information to be processed compactly and efficiently on quantum processors. Recently developed techniques such as controlled beam-splitter operations and the near deterministic phonon subtractions make trapped ion systems attractive for exploring CV quantum computing. Here we propose a probabilistic scheme based on the boson sculpting technique for generating multipartite highly entangled states of motional modes of trapped ion systems. We also investigate the effects of decoherence on the fidelity of the generated state by performing numerical simulat…
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the quantum annealing algorithm for programmable use. Specifically, quantum annealing processors produced by D-Wave Systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for quantum ann…
Quantum information is vulnerable to environmental noise and experimental imperfections, hindering the reliability of practical quantum information processors. Therefore, quantum error correction (QEC) that can protect quantum information against noise is vital for universal and scalable quantum computation. Among many different experimental platforms, superconducting quantum circuits and bosonic encodings in superconducting microwave modes are appealing for their unprecedented potential in QEC. During the last few years, bosonic QEC is demonstrated to reach the break-even point, i.e. the life…
Continuous-variable quantum information processing through quantum optics offers a promising platform for building the next generation of scalable fault-tolerant information processors. To achieve quantum computational advantages and fault tolerance, non-Gaussian resources are essential. In this work, we propose and analyze a method to generate a variety of non-Gaussian states using coherent photon subtraction from a two-mode squeezed state followed by photon-number-resolving measurements. The proposed method offers a promising way to generate rotation-symmetric states conventionally used for …
We propose a computationally efficient method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint master equation to a set of partial differential equations for these functions, which are subsequently solved numerically. In the limit of weak coupling to the environment, the mapping of the operator enables storing the operator efficiently during the simulation, leading to approximately quadratic improvement in the memory consumption compared with the direct …
Solving discrete NP-hard problems is an important part of scientific discoveries and operations research as well as many commercial applications. A commonly used metric to compare meta-heuristic solvers is the time required to obtain an optimal solution, known as time to solution. However, for some applications it is desirable to have a set of high-quality and diverse solutions, instead of a single optimal one. For these applications, time to solution may not be informative of the performance of a solver, and another metric would be necessary. In particular, it is not known how well quantum so…
Oscillator-qubit generalized quantum signal processing for vibronic models: a case study of uracil cation
SKKU Advanced Institute of Nano Technology (SAINT), Sungkyunkwan University（成均馆大学 SKKU 纳米技术高级研究所 (SAINT)）；Ulsan National Institute of Science and Technology（蔚山科学技术院）；Yonsei University（延世大学）
Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors
Tsinghua University（清华大学）；Frontier Science Center for Quantum Information（量子信息前沿科学中心）；Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）；Hefei National Laboratory（合肥国家实验室）
We consider an exact state transmission, where a density matrix in one information processor A at time $t=0$ is exactly equal to that in another processor B at a later time. We demonstrate that there always exists a complete set of orthogonal states, which can be employed to perform the exact state transmission. Our result is very general in the sense that it holds for arbitrary media between the two processors and for any time interval. We illustrate our results in terms of models of spin, fermionic and bosonic chains. This complete set can be used as bases to study the perfect state transfer…
Error Mitigation in Bosonic Systems via Virtual Distillation
Chalmers University of Technology（查尔姆斯理工大学）；École polytechnique, Institut Polytechnique de Paris（巴黎综合理工学院，巴黎理工学院）；Université libre de Bruxelles（布鲁塞尔自由大学）；International Iberian Nanotechnology Laboratory (INL)（国际伊比利亚纳米技术实验室）；University of Minho（米尼奥大学）
We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices and apply it to molecular vibrational anharmonic Hamiltonians. Our method supports generic reference modal bases and Hamiltonian representations, including the ones that are routinely used in classical vibrational structure calculations. We test different parametrizations of the vibrational wave function, which can be encoded in quantum hardware, based either on heuristic circuits or on the bosonic Unitary Coupled Cluster Ansatz. In particular, we define a…
The development of large-scale optical quantum information processing circuits ground on the stability and reconfigurability enabled by integrated photonics. We demonstrate a reconfigurable 8x8 integrated linear optical network based on silicon nitride waveguides for quantum information processing. Our processor implements a novel optical architecture enabling any arbitrary linear transformation and constitutes the largest programmable circuit reported so far on this platform. We validate a variety of photonic quantum information processing primitives, in the form of Hong-Ou-Mandel interferenc…
Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this work, we introduce a new benchmark for variational quantum algorithm (VQA), recently proposed as a heuristic algorithm for small-scale quantum processors. In VQA, a classical optimization algorithm guides the quantum dynamics of the processor to yield the best solution for a given problem. A complete assessment of scalability and competitiveness of VQA should take into account both the quality and the time of dynamics optimization. The method of optima…
Quantum algorithms need to be compiled to respect the constraints imposed by quantum processors, which is known as the mapping problem. The mapping procedure will result in an increase of the number of gates and of the circuit latency, decreasing the algorithm's success rate. It is crucial to minimize mapping overhead, especially for Noisy Intermediate-Scale Quantum (NISQ) processors that have relatively short qubit coherence times and high gate error rates. Most of prior mapping algorithms have only considered constraints such as the primitive gate set and qubit connectivity, but the actual g…
We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy- Intermediate-Scale Quantum devices era, our A* inspired algorithm attempts to minimize their count, while accounting for connectivity. We discuss the search strategy together with metrics to expand the solution frontier. For a workload of circuits with complexity appropriate for the NISQ era, we produce solutions well within the best upper bounds published in literature and match or exceed hand tuned implementations, as wel…
Protecting bosonic codes from ancilla-induced errors with continuous-variable flags
Alice & Bob（爱丽丝与鲍勃）；Laboratoire de Physique de l’École Normale Supérieure, Inria, ENS, Mines ParisTech, Université PSL, Sorbonne Université（巴黎高等师范学院物理实验室、法国国家信息与自动化研究所、巴黎高等师范学院、巴黎矿业学院、巴黎文理研究大学、索邦大学）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）
Hardware-Aware QAOA for Honeypot Traffic Partitioning on 100+ Qubit IBM Quantum Processors
Future of Computing Institute, Rensselaer Polytechnic Institute（未来计算研究所，伦斯勒理工学院）；School of Computer Science and Mathematics, Marist University（计算机科学与数学学院，玛里斯特大学）
Optimising Cryogenic Wiring for Microwave-frequency Millikelvin Quantum Processors
Sydney Quantum Academy（悉尼量子学院）；Centre for Quantum Software & Information, School of Mathematical & Physical Sciences, University of Technology Sydney（悉尼科技大学数学与物理科学学院量子软件与信息研究中心）
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated annealing including those using qubitization or Szegedy walks to quantize classical Markov chains and those simulating spectral gap amplified Hamiltonians encoding a Gibbs state. We also optimize fault-tolerant realizations of the adiabatic algorithm, quantum enhanced population transfer, the quantum approximate optimization algorithm, and other approaches. Many …
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variational quantum algorithms are optimization heuristics that can be demonstrated with available quantum hardware. In this case study, we apply four variational quantum heuristics running on IBM's superconducting quantum processors to the job shop scheduling problem. Our problem optimizes a steel manufacturing process. A comparison on 5 qubit…
We present an analytical description of the tunneling dynamics between two coupled Bose-Einstein condensates in the Josephson regime. The model relies on the classical analogy with a rigid pendulum and focuses on two dynamical modes of this system: Josephson oscillations and Macroscopic Quantum Self-Trapping. The analogy is extended to include an energy difference between the two superfluids caused by an asymmetry in the trapping potential. The model is compatible with the mean-field predictions of the two-mode Bose-Hubbard model. It gives new insights on the mean-field model by involving expe…
In this paper, we formally describe the three challenges of mapping surface code on superconducting devices, and present a comprehensive synthesis framework to overcome these challenges. The proposed framework consists of three optimizations. First, we adopt a geometrical method to allocate data qubits which ensures the existence of shallow syndrome extraction circuit. The proposed data qubit layout optimization reduces the overhead of syndrome extraction and serves as a good initial point for following optimizations. Second, we only use bridge qubits enclosed by data qubits and reduce the num…
Multi-Objective Optimization with Quantum-Annealing-Inspired Algorithms
Southern University of Science and Technology（南方科技大学）；International Quantum Academy（国际量子研究院）；University of Science and Technology of China（中国科学技术大学）；Hong Kong Polytechnic University（香港理工大学）
We study Bosonic representation of spin Ising model with the application of simulating two level systems using continuous variable quantum processors. We decompose the time evolution of spin systems into a sequence of continuous variable logical gates and analyze their structure. We provide an estimation of quantum circuit scaling with the size of the spin lattice system. Furthermore, we discuss the possibility of using a Gaussian Boson sampling device to estimate the ground state energy of Ising Hamiltonian. The result has potential application in developing hybrid classical-quantum algorithm…
