Tootfinder

This https://arxiv.org/abs/2307.02091 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Quantum support vector machines for classification and regression on a trapped-ion quantum computer
Quantum machine learning is a rapidly growing field at the intersection of quantum computing and machine learning. In this work, we examine our quantum machine learning models, which are based on quantum support vector classification (QSVC) and quantum support vector regression (QSVR). We investigate these models using a quantum-circuit simulator, both with and without noise, as well as the IonQ Harmony quantum processor. For the QSVC tasks, we use a dataset containing fraudulent credit card tr…

Not everyone is impressed with the announcement that the Australian government is funding quantum computing development. #auspol https://www.crikey.com.au/2024/04/30/labor

Labor reduces transparency to the quantum level in deal with US firm
The deal to invest $940 million in a Californian quantum computer company is marked by plenty of secrecy and no clarity on the case for the spending.

This https://arxiv.org/abs/2403.14142 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Unconditional verification of quantum computation with classical light
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate quantum communication to unconditionally detect any malicious behavior of the quantum computer solving any promise problem in ${\sf BQP}$. In this paper, we remove the necessity of the communication of qubits by proposing a "physically-classical" verification p…

Explaining Grover's algorithm with a colony of ants: a pedagogical model for making quantum technology comprehensible
Merel A Schalkers, Kamiel Dankers, Michael Wimmer, Pieter Vermaas
https://arxiv.org/abs/2405.00014

Explaining Grover's algorithm with a colony of ants: a pedagogical model for making quantum technology comprehensible
The rapid growth of quantum technologies requires an increasing number of physicists, computer scientists, and engineers who can work on these technologies. For educating these professionals, quantum mechanics should stop being perceived as incomprehensible. In this paper we contribute to this change by presenting a pedagogical model for explaining Grover's search algorithm, a prominent quantum algorithm. This model visualizes the three main steps of Grover's algorithm and, in addition to expla…

“Commodore 64 claimed to outperform IBM's quantum system — sarcastic researchers say 1 MHz computer is faster, more efficient, and decently accurate”
https://www.tomshardware.com/t…

Commodore 64 claimed to outperform IBM's quantum system — sarcastic researchers say 1 MHz computer is faster, more efficient, and decently accurate
Qommodore 64' born from 2,500 lines of MOS 6502 assembly code.

Nvidia launches Quantum Cloud, a service that simulates a quantum computer and allows researchers to test out their quantum computing software (Jane Lanhee Lee/Bloomberg)
https://www.bloomberg.com/news/articles/2024-…

Nvidia Joins Ongoing Race in Quantum-Computing Cloud Services
Nvidia Corp. launched a cloud service for researchers to test out their quantum-computing software, seeking to profit from a field that’s winning funding around the world despite yielding few groundbreaking applications so far.

Commodore 64 claimed to outperform IBM's quantum system — sarcastic researchers say 1 MHz computer is faster, more efficient, and decently accurate
https://www.tomshardware.com/tech-industry/quantum-computing/commodore-64-outperforms-ibms-quantum-systems-1-mhz-computer-said-to-be-faster-more-efficient-and-decently-accurate

Demonstration of system-bath physics on gate-based quantum computer
Pascal Stadler, Matteo Lodi, Andisheh Khedri, Rolando Reiner, Kirsten Bark, Nicolas Vogt, Michael Marthaler, Juha Lepp\"akangas
https://arxiv.org/abs/2404.18828

Demonstration of system-bath physics on gate-based quantum computer
We demonstrate algorithmic cooling on IBM-Q devices. We utilize inherent qubit noise to simulate the equilibration of an interacting spin system towards its ground state, when coupled to a dissipative auxiliary-spin bath. The steady-state correlations in the system are defined by the system Hamiltonian and are stable as long as the algorithm can be executed. In particular, we demonstrate the relaxation of system spins to ferromagnetic and antiferromagnetic ordering, controlled by the definition…

The weirdest thing about the AI hype is the claims that computers will become sentient and human-level intelligent.
There’s zero evidence that the human brain (the only thing that we know of that is capable of human-level sentience and intelligence) works like a computer or that it could even be simulated by one.
Some neuroscience points to quantum mechanical effects being at the core of how neurons work, which basically means that we don’t have a clue how the brain really works.…

Towards Classical Software Verification using Quantum Computers
Sebastian Issel, Kilian Tscharke, Pascal Debus
https://arxiv.org/abs/2404.18502 https://

Towards Classical Software Verification using Quantum Computers
We explore the possibility of accelerating the formal verification of classical programs with a quantum computer. A common source of security flaws stems from the existence of common programming errors like use after free, null-pointer dereference, or division by zero. To aid in the discovery of such errors, we try to verify that no such flaws exist. In our approach, for some code snippet and undesired behaviour, a SAT instance is generated, which is satisfiable precisely if the behavior is…

These "hey if this lattice quantum algorithm turns out to work, it will break fully homomorphic encryption, and maybe also we cannot fix encrypted internet connection once a quantum computer arrives" statements. Like HEY THESE PROBLEMS AREN'T EVEN IN THE SAME UNIVERSE OF ISSUES. One is "cryptographers may have to admit that their favorit hypothetical solution for nonexisting problems doesn't work", the other is "like, how do we continue with the internet?&quo…

Beating IBM’s Eagle Quantum Processor On An Ising Model With a Classical Tensor Network
https://poliverso.org/display/0477a01e-c9a8ef87-63ea661b7089dbdc
Beating IBM’s Eagle Quantum Processor On An Ising Model With a Classical Tensor Network The cent…

Sampling Problems on a Quantum Computer
Maximilian Balthasar Mansky, Jonas N\"u{\ss}lein, David Bucher, Dani\"elle Schuman, Sebastian Zielinski, Claudia Linnhoff-Popien
https://arxiv.org/abs/2402.16341

Sampling Problems on a Quantum Computer
Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel quantum methods have been developed in recent years. In this paper, we provide a survey of quantum sampling methods alongside needed theory and applications of those sampling methods as a starting point for research in this area. This work focuses in particula…

This https://arxiv.org/abs/2404.00062 has been replaced.
link: https://scholar.google.com/scholar?q=a

Modelling the Impact of Quantum Circuit Imperfections on Networks and Computer Applications
Post Quantum and Quantum Cryptography schemes are feasible quantum computer applications for 7G networks. These schemes could possibly replace existing schemes. These algorithms have been compromised by advances in quantum search algorithms run on quantum computers like Shor algorithm. Shor algorithm is a quantum algorithm for finding the prime factors of an integer which is the basis of existing algorithm. This has become an available quantum computer application putting the use of ESA algorit…

Bound-state confinement after trap-expansion dynamics in integrable systems
Leonardo Biagetti, Vincenzo Alba
https://arxiv.org/abs/2402.17623 https://

Bound-state confinement after trap-expansion dynamics in integrable systems
Integrable systems possess stable families of quasiparticles, which are composite objects (bound states) of elementary excitations. Motivated by recent quantum computer experiments, we investigate bound-state transport in the spin-$1/2$ anisotropic Heisenberg chain ($XXZ$ chain). Specifically, we consider the sudden vacuum expansion of a finite region $A$ prepared in a non-equilibrium state. In the hydrodynamic regime, if interactions are strong enough, bound states remain confined in the initi…

Sampling Problems on a Quantum Computer
Maximilian Balthasar Mansky, Jonas N\"u{\ss}lein, David Bucher, Dani\"elle Schuman, Sebastian Zielinski, Claudia Linnhoff-Popien
https://arxiv.org/abs/2402.16341

Sampling Problems on a Quantum Computer
Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel quantum methods have been developed in recent years. In this paper, we provide a survey of quantum sampling methods alongside needed theory and applications of those sampling methods as a starting point for research in this area. This work focuses in particula…

The impact of noise on the simulation of NMR spectroscopy on NISQ devices
Andisheh Khedri, Pascal Stadler, Kirsten Bark, Matteo Lodi, Rolando Reiner, Nicolas Vogt, Michael Marthaler, Juha Lepp\"akangas
https://arxiv.org/abs/2404.18903

The impact of noise on the simulation of NMR spectroscopy on NISQ devices
We present the simulation of nuclear magnetic resonance (NMR) spectroscopy of small organic molecules with two promising quantum computing platforms, namely IBM's quantum processors based on superconducting qubits and IonQ's Aria trapped ion quantum computer addressed via Amazon Bracket. We analyze the impact of noise on the obtained NMR spectra, and we formulate an effective decoherence rate that quantifies the threshold noise that our proposed algorithm can tolerate. Furthermore we showcase h…

First Hitting Times on a Quantum Computer: Topological Effects and Dark States
Qingyuan Wang, Silin Ren, Ruoyu Yin, Klaus Ziegler, Eli Barkai, Sabine Tornow
https://arxiv.org/abs/2402.15843

First Hitting Times on a Quantum Computer: Topological Effects and Dark States
We investigate a quantum walk on a ring represented by a directed triangle graph with complex edge weights and monitored at a constant rate until the quantum walker is detected. To this end, the first hitting time statistics is recorded using unitary dynamics interspersed stroboscopically by measurements, which is implemented on IBM quantum computers with a midcircuit readout option. Unlike classical hitting times, the statistical aspect of the problem depends on the way we construct the measur…

First Hitting Times on a Quantum Computer: Topological Effects and Dark States
Qingyuan Wang, Silin Ren, Ruoyu Yin, Klaus Ziegler, Eli Barkai, Sabine Tornow
https://arxiv.org/abs/2402.15843

First Hitting Times on a Quantum Computer: Topological Effects and Dark States
We investigate a quantum walk on a ring represented by a directed triangle graph with complex edge weights and monitored at a constant rate until the quantum walker is detected. To this end, the first hitting time statistics is recorded using unitary dynamics interspersed stroboscopically by measurements, which is implemented on IBM quantum computers with a midcircuit readout option. Unlike classical hitting times, the statistical aspect of the problem depends on the way we construct the measur…

This https://arxiv.org/abs/2309.00447 has been replaced.
initial toot: https://mastoxiv.page/@a…

Fermionic quantum computation with Cooper pair splitters
We propose a practical implementation of a universal quantum computer that uses local fermionic modes (LFM) rather than qubits. The device layout consists of quantum dots tunnel coupled by a hybrid superconducting island and a tunable capacitive coupling between the dots. We show that coherent control of Cooper pair splitting, elastic cotunneling, and Coulomb interactions allows us to implement the universal set of quantum gates defined by Bravyi and Kitaev. Due to the similarity with charge qu…

Quasi-parton distributions in massive QED2: Towards quantum computation
Sebastian Grieninger, Kazuki Ikeda, Ismail Zahed
https://arxiv.org/abs/2404.05112 h…

Quasi-parton distributions in massive QED2: Towards quantum computation
We analyze the quasi-parton distributions of the lightest $η'$ meson in massive two-dimensional Quantum electrodynamics (QED2) by performing a digital quantum simulation on a classical computer (exact diagonalization). The Hamiltonian and boost operators are mapped onto spin qubits in a spatial lattice with open boundary conditions. The lowest excited state in the exact diagonalization is shown to interpolate continuously between an anomalous $η'$ state at strong coupling,and a non-anomalous …

This https://arxiv.org/abs/2402.10903 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Continuum limit of the Green function in scaled affine $φ^4_4$ quantum Euclidean covariant relativistic field theory
We prove through path integral Monte Carlo computer experiments that the affine quantization of the $φ_4^4$ scaled Euclidean covariant relativistic scalar field theory is a valid quantum field theory with a well defined continuum limit of the one- and two-point-function. Affine quantization leads to a completely satisfactory quantization of field theories using situations that involve scaled behavior leading to an unexpected, $\hbar^2/φ^2$ which arises only in the quantum aspects.

Subspace methods for the simulation of molecular response properties on a quantum computer
Peter Reinholdt, Erik Rosendahl Kjellgren, Juliane Holst Fuglsbjerg, Karl Michael Ziems, Sonia Coriani, Stephan P. A. Sauer, Jacob Kongsted
https://arxiv.org/abs/2402.12186

Subspace methods for the simulation of molecular response properties on a quantum computer
We explore Davidson methods for obtaining excitation energies and other linear response properties within quantum self-consistent linear response (q-sc-LR) theory. Davidson-type methods allow for obtaining only a few selected excitation energies without explicitly constructing the electronic Hessian since they only require the ability to perform Hessian-vector multiplications. We apply the Davidson method to calculate the excitation energies of hydrogen chains (up to H$_{10}$) and analyze aspec…

This https://arxiv.org/abs/2310.07058 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Ion Trap with In-Vacuum High Numerical Aperture Imaging for a Dual-Species Modular Quantum Computer
Photonic interconnects between quantum systems will play a central role in both scalable quantum computing and quantum networking. Entanglement of remote qubits via photons has been demonstrated in many platforms; however, improving the rate of entanglement generation will be instrumental for integrating photonic links into modular quantum computers. We present an ion trap system that has the highest reported free-space photon collection efficiency for quantum networking. We use a pair of in-va…

This https://arxiv.org/abs/2402.03371 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Zeno effect in a quantum computer
We present a simulation of the quantum Zeno effect (QZE) on a quantum computer as an example of the relation between this effect and the bang-bang decoupling method in control theory. Although the true QZE can not be strictly implemented on a quantum computer where all the operations, except the final measurements, must be unitary ones, we can simulate it by coupling the system to a number of ancillas and replacing the projective measurements of the QZE by suitable unitary gates.

Algorithmic Bayesian Epistemology
Eric Neyman
https://arxiv.org/abs/2403.07949 https://arxiv.org/pdf/2403.07949

Algorithmic Bayesian Epistemology
One aspect of the algorithmic lens in theoretical computer science is a view on other scientific disciplines that focuses on satisfactory solutions that adhere to real-world constraints, as opposed to solutions that would be optimal ignoring such constraints. The algorithmic lens has provided a unique and important perspective on many academic fields, including molecular biology, ecology, neuroscience, quantum physics, economics, and social science. This thesis applies the algorithmic lens to…

On the Theory of Quantum and Towards Practical Computation
Robert Kudeli\'c
https://arxiv.org/abs/2403.09682 https://arxiv.org/pd…

On the Theory of Quantum and Towards Practical Computation
Quantum computing exposes the brilliance of quantum mechanics through computer science and, as such, gives oneself a marvelous and exhilarating journey to go through. This article leads along that journey with a historical and current outlook on quantum computation that is geared toward computer experts but also to experts from other disciplines as well. It is an article that will bridge the vast gap between classical and quantum computation and open an entering wedge through which one will be …

This https://arxiv.org/abs/2309.17233 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Open Hardware Solutions in Quantum Technology
Quantum technologies such as communications, computing, and sensing offer vast opportunities for advanced research and development. While an open-source ethos currently exists within some quantum technologies, especially in quantum computer programming, we argue that there are additional advantages in developing open quantum hardware (OQH). Open quantum hardware encompasses open-source software for the control of quantum devices in labs, blueprints and open-source toolkits for chip design and o…

Computational Kerr-Ellipsometry: Quantifying Broadband Optical Nonreciprocity of Magneto-Optic Materials
Vishal ChoudhuryMax Planck Institute for the Science of Light, Chinmay KhandekarBirck Nanotechnology Center, Elmore Family School of Electrical and Computer Engineering, Purdue University, Ashwin K. BoddetiBirck Nanotechnology Center, Elmore Family School of Electrical and Computer Engineering, Purdue University, Ali JishiBirck Nanotechnology Center, Elmore Family School of Electric…

Computational Kerr-Ellipsometry: Quantifying Broadband Optical Nonreciprocity of Magneto-Optic Materials
Characterizing the optical response of magneto-optic and magnetic materials usually relies on semi-classical models (e.g. Lorentz oscillator model) involving few parameters or models based on a detailed quantum mechanical description of the underlying response. These models typically involve a few parameters that are estimated via fitting the experimental data to provide a qualitative understanding of the underlying physics. Such a few-parameters fitting approach falls short of accurately captu…

This https://arxiv.org/abs/2403.03283 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Deterministic Bethe state preparation
We present an explicit quantum circuit that prepares an arbitrary $U(1)$-eigenstate on a quantum computer, including the exact eigenstates of the spin-1/2 XXZ quantum spin chain with either open or closed boundary conditions. The algorithm is deterministic, does not require ancillary qubits, and does not require QR decompositions. The circuit prepares such an $L$-qubit state with $M$ down-spins using $\binom{L}{M}-1$ multi-controlled rotation gates and $2M(L-M)$ CNOT-gates.

Subspace methods for the simulation of molecular response properties on a quantum computer
Peter Reinholdt, Erik Rosendahl Kjellgren, Juliane Holst Fuglsbjerg, Karl Michael Ziems, Sonia Coriani, Stephan P. A. Sauer, Jacob Kongsted
https://arxiv.org/abs/2402.12186

Subspace methods for the simulation of molecular response properties on a quantum computer
We explore Davidson methods for obtaining excitation energies and other linear response properties within quantum self-consistent linear response (q-sc-LR) theory. Davidson-type methods allow for obtaining only a few selected excitation energies without explicitly constructing the electronic Hessian since they only require the ability to perform Hessian-vector multiplications. We apply the Davidson method to calculate the excitation energies of hydrogen chains (up to H$_{10}$) and analyze aspec…

This https://arxiv.org/abs/2306.12862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Optimization tools for distance-preserving flag fault-tolerant error correction
Lookup table decoding is fast and distance-preserving, making it attractive for near-term quantum computer architectures with small-distance quantum error-correcting codes. In this work, we develop several optimization tools that can potentially reduce the space and time overhead required for flag fault-tolerant quantum error correction (FTQEC) with lookup table decoding on Calderbank-Shor-Steane (CSS) codes. Our techniques include the compact lookup table construction, the Meet-in-the-Middle t…

This https://arxiv.org/abs/2401.09268 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
Simulating chemical systems is highly sought after and computationally challenging, as the simulation cost exponentially increases with the system size. Quantum computers have been proposed as a computational means to overcome this bottleneck. Most efforts recently have been spent on determining the ground states of chemical systems. Hardness results and the lack of efficient heuristics for initial-state generation sheds doubt on the feasibility. Here we propose an inherently efficient approach…

This https://arxiv.org/abs/2401.17211 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Quantum dynamics in one and two dimensions via recursion method
We report an implementation of the recursion method that addresses quantum many-body dynamics in the nonperturbative regime. The method essentially amounts to constructing a Lanczos basis in the space of operators and solving coupled Heisenberg equations in this basis. The reported implementation has two key ingredients: a computer-algebraic routine for symbolic calculation of nested commutators and a procedure to extrapolate the sequence of Lanczos coefficients according to the universal opera…

This https://arxiv.org/abs/2308.15532 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Information Bounds on phase transitions in disordered systems
Information theory, rooted in computer science, and many-body physics, have traditionally been studied as (almost) independent fields. Only recently has this paradigm started to shift, with many-body physics being studied and characterized using tools developed in information theory. In our work, we introduce a new perspective on this connection, and study phase transitions in models with randomness, such as localization in disordered systems, or random quantum circuits with measurements. Utili…

Benefits of non-adiabatic quantum control in quantum computation through spin qubit systems
Nirupam Dutta
https://arxiv.org/abs/2403.11288 https://<…

Benefits of non-adiabatic quantum control in quantum computation through spin qubit systems
This is evident that the controllable quantum systems can be the reliable building blocks for Quantum computation. In reality we are witnessing the progress towards making the idea tractable enough, though optimistic but the threshold is not very near to us. The dawn of quantum computation has begun. In the future, we hope to see a full fledged operationally stable quantum computer which can solve the problems beyond the scope of classical digital computers. We may call it quantum supremacy. Ne…

This https://arxiv.org/abs/2312.12831 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hep…

First-Order Phase Transition of the Schwinger Model with a Quantum Computer
We explore the first-order phase transition in the lattice Schwinger model in the presence of a topological $θ$-term by means of the variational quantum eigensolver (VQE). Using two different fermion discretizations, Wilson and staggered fermions, we develop parametric ansatz circuits suitable for both discretizations, and compare their performance by simulating classically an ideal VQE optimization in the absence of noise. The states obtained by the classical simulation are then prepared on t…

Algorithmic Bayesian Epistemology
Eric Neyman
https://arxiv.org/abs/2403.07949 https://arxiv.org/pdf/2403.07949

Algorithmic Bayesian Epistemology
One aspect of the algorithmic lens in theoretical computer science is a view on other scientific disciplines that focuses on satisfactory solutions that adhere to real-world constraints, as opposed to solutions that would be optimal ignoring such constraints. The algorithmic lens has provided a unique and important perspective on many academic fields, including molecular biology, ecology, neuroscience, quantum physics, economics, and social science. This thesis applies the algorithmic lens to…

This https://arxiv.org/abs/2403.03052 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Simulation of Chemical Reactions on a Quantum Computer
Studying chemical reactions, particularly in the gas phase, relies heavily on computing scattering matrix elements. These elements are essential for characterizing molecular reactions and accurately determining reaction probabilities. However, the intricate nature of quantum interactions poses challenges, necessitating the use of advanced mathematical models and computational approaches to tackle the inherent complexities. In this study, we develop and apply a quantum algorithm for the calculat…

Quantum Expander Mixing Lemma and its Converse
Ning Ning
https://arxiv.org/abs/2403.11454 https://arxiv.org/pdf/2403.11454

Quantum Expander Mixing Lemma and its Converse
Expander graphs are fundamental in both computer science and mathematics, with a wide array of applications. With quantum technology reshaping our world, quantum expanders have emerged, finding numerous uses in quantum information theory. The classical expander mixing lemma plays a central role in graph theory, offering essential insights into edge distribution within graphs and aiding in the analysis of diverse network properties and algorithms. This paper establishes the quantum analogue of t…

This https://arxiv.org/abs/2311.11167 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Benchmarking Machine Learning Models for Quantum Error Correction
Quantum Error Correction (QEC) is one of the fundamental problems in quantum computer systems, which aims to detect and correct errors in the data qubits within quantum computers. Due to the presence of unreliable data qubits in existing quantum computers, implementing quantum error correction is a critical step when establishing a stable quantum computer system. Recently, machine learning (ML)-based approaches have been proposed to address this challenge. However, they lack a thorough understa…

This https://arxiv.org/abs/2404.10050 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer
We perform a detailed resource estimate for the prospect of using deep entanglement renormalization ansatz (DMERA) on a fault-tolerant quantum computer, focusing on the regime in which the target system is large. For probing a relatively large system size ($64\times 64$), we observe up to an order of magnitude reduction in the number of qubits, compared to the approaches based on quantum phase estimation (QPE). We discuss two complementary strategies to measure the energy. The first approach is…

Amplified Amplitude Estimation: Exploiting Prior Knowledge to Improve Estimates of Expectation Values
Sophia Simon, Matthias Degroote, Nikolaj Moll, Raffaele Santagati, Michael Streif, Nathan Wiebe
https://arxiv.org/abs/2402.14791

Amplified Amplitude Estimation: Exploiting Prior Knowledge to Improve Estimates of Expectation Values
We provide a method for estimating the expectation value of an operator that can utilize prior knowledge to accelerate the learning process on a quantum computer. Specifically, suppose we have an operator that can be expressed as a concise sum of projectors whose expectation values we know a priori to be $O(ε)$. In that case, we can estimate the expectation value of the entire operator within error $ε$ using a number of quantum operations that scales as $O(1/\sqrtε)$. We then show how this c…

This https://arxiv.org/abs/2306.02059 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Enhancing Quantum Annealing in Digital-Analog Quantum Computing
Digital-analog quantum computing (DAQC) offers a promising approach to addressing the challenges of building a practical quantum computer. By efficiently allocating resources between digital and analog quantum circuits, DAQC paves the way for achieving optimal performance. We propose an algorithm designed to enhance the performance of quantum annealing. This method employs a quantum gate to estimate the goodness of the final annealing state and find the ground state of combinatorial optimizatio…

This https://arxiv.org/abs/2310.05866 has been replaced.
link: https://scholar.google.com/scholar?q=a

Generative quantum machine learning via denoising diffusion probabilistic models
Deep generative models are key-enabling technology to computer vision, text generation, and large language models. Denoising diffusion probabilistic models (DDPMs) have recently gained much attention due to their ability to generate diverse and high-quality samples in many computer vision tasks, as well as to incorporate flexible model architectures and a relatively simple training scheme. Quantum generative models, empowered by entanglement and superposition, have brought new insight to learni…

This https://arxiv.org/abs/2307.10560 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Post-variational quantum neural networks
Hybrid quantum-classical computing in the noisy intermediate-scale quantum (NISQ) era with variational algorithms can exhibit barren plateau issues, causing difficult convergence of gradient-based optimization techniques. In this paper, we discuss "post-variational strategies", which shift tunable parameters from the quantum computer to the classical computer, opting for ensemble strategies when optimizing quantum models. We discuss various strategies and design principles for constructing indi…

Qiskit-Torch-Module: Fast Prototyping of Quantum Neural Networks
Nico Meyer, Christian Ufrecht, Maniraman Periyasamy, Axel Plinge, Christopher Mutschler, Daniel D. Scherer, Andreas Maier
https://arxiv.org/abs/2404.06314

Qiskit-Torch-Module: Fast Prototyping of Quantum Neural Networks
Quantum computer simulation software is an integral tool for the research efforts in the quantum computing community. An important aspect is the efficiency of respective frameworks, especially for training variational quantum algorithms. Focusing on the widely used Qiskit software environment, we develop the qiskit-torch-module. It improves runtime performance by two orders of magnitude over comparable libraries, while facilitating low-overhead integration with existing codebases. Moreover, the…

Qiskit-Torch-Module: Fast Prototyping of Quantum Neural Networks
Nico Meyer, Christian Ufrecht, Maniraman Periyasamy, Axel Plinge, Christopher Mutschler, Daniel D. Scherer, Andreas Maier
https://arxiv.org/abs/2404.06314

Qiskit-Torch-Module: Fast Prototyping of Quantum Neural Networks
Quantum computer simulation software is an integral tool for the research efforts in the quantum computing community. An important aspect is the efficiency of respective frameworks, especially for training variational quantum algorithms. Focusing on the widely used Qiskit software environment, we develop the qiskit-torch-module. It improves runtime performance by two orders of magnitude over comparable libraries, while facilitating low-overhead integration with existing codebases. Moreover, the…

Hamiltonian engineering with time-ordered evolution for unitary control of electron spins in semiconductor quantum dots
Bohdan Khromets, Zach D. Merino, Jonathan Baugh
https://arxiv.org/abs/2402.08146

Hamiltonian engineering with time-ordered evolution for unitary control of electron spins in semiconductor quantum dots
We present a unitary control pulse design method for a scalable quantum computer architecture based on electron spins in lateral quantum dots. We employ simultaneous control of spin interactions and derive the functional forms of spin Hamiltonian parameter pulses for a universal set of 1- and 2-qubit logic gates. This includes selective spin rotations with the weak local g-factor variations in the presence of the global oscillating field, and a Control-Phase operation with the simultaneous cont…

This https://arxiv.org/abs/2403.14630 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Study on quantum thermalization from thermal initial states in a superconducting quantum computer
Quantum thermalization in contemporary quantum devices, in particular quantum computers, has recently attracted significant theoretical interest. Unusual thermalization processes, such as the Quantum Mpemba Effect (QME), have been explored theoretically. However, there is a shortage of experimental results due to the difficulty in preparing thermal states. In this paper, we propose a method to address this challenge. Moreover, we experimentally validate our approach using IBM quantum devices, p…

This https://arxiv.org/abs/2402.12661 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Dynamics of Symmetry-Protected Topological Matter on a Quantum Computer
Control of topological edge modes is desirable for encoding quantum information resiliently against external noise. Their implementation on quantum hardware, however, remains a long-standing problem due to current limitations of circuit depth and noise, which grows with the number of time steps. By utilizing recently developed constant-depth quantum circuits in which the circuit depth is independent of time, we demonstrate successful long-time dynamics simulation of bulk and surface modes in to…

This https://arxiv.org/abs/2402.15843 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

First Hitting Times on a Quantum Computer: Tracking vs. Local Monitoring, Topological Effects, and Dark States
We investigate a quantum walk on a ring represented by a directed triangle graph with complex edge weights and monitored at a constant rate until the quantum walker is detected. To this end, the first hitting time statistics is recorded using unitary dynamics interspersed stroboscopically by measurements, which is implemented on IBM quantum computers with a midcircuit readout option. Unlike classical hitting times, the statistical aspect of the problem depends on the way we construct the measur…

This https://arxiv.org/abs/2402.16944 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Probing anyonic statistics via Mach-Zehnder interferometry in quantum computers
We introduce a synthetic Mach-Zehnder interferometer for digitized quantum computing devices to probe fractional exchange statistics of anyonic excitations that appear in quantum spin liquids. Employing an IonQ quantum computer, we apply this scheme to the toric ladder, a quasi-one-dimensional reduction of the toric code. We observe interference patterns resulting from the movement of `electric' excitations in the presence and absence of `magnetic' ones. We model the noise in IonQ via depolariz…

This https://arxiv.org/abs/2311.15859 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential
We explore the possibility of adding complex absorbing potential at the boundaries when solving the one-dimensional real-time Schrödinger evolution on a grid using a quantum computer with a fully quantum algorithm described on a $n$ qubit register. Due to the complex potential, the evolution mixes real- and imaginary-time propagation and the wave function can potentially be continuously absorbed during the time propagation. We use the dilation quantum algorithm to treat the imaginary-time evol…

This https://arxiv.org/abs/2309.01028 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Demonstration of a Hardware-Independent Toolkit for Automated Quantum Subcircuit Synthesis
The quantum computer has become contemporary reality, with the first two-qubit machine of mere decades ago transforming into cloud-accessible devices with tens, hundreds, or -- in a few cases -- even thousands of qubits. While such hardware is noisy and still relatively small, the increasing number of operable qubits raises another challenge: how to develop the now-sizeable quantum circuits executable on these machines. Preparing circuits manually for specifications of any meaningful size is at…

This https://arxiv.org/abs/2310.00121 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer
The construction of quantum circuits to simulate Hamiltonian evolution is central to many quantum algorithms. State-of-the-art circuits are based on oracles whose implementation is often omitted, and the complexity of the algorithm is estimated by counting oracle queries. However, in practical applications, an oracle implementation contributes a large constant factor to the overall complexity of the algorithm. The key finding of this work is the efficient procedure for representation of a tridi…

This https://arxiv.org/abs/2212.01571 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
Estimating statistical properties is fundamental in statistics and computer science. In this paper, we propose a unified quantum algorithm framework for estimating properties of discrete probability distributions, with estimating Rényi entropies as specific examples. In particular, given a quantum oracle that prepares an $n$-dimensional quantum state $\sum_{i=1}^{n}\sqrt{p_{i}}|i\rangle$, for $α>1$ and $0<α<1$, our algorithm framework estimates $α$-Rényi entropy $H_α(p)$ to within ad…

This https://arxiv.org/abs/2403.03992 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings
Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode the Fermioinc problem in the qubits of a quantum computer. In this work, we introduce "treespilation," a technique for efficiently mapping Fermionic systems using a large family of favourable tree-based mappings previously introduced by some of us. We use thi…

This https://arxiv.org/abs/2401.09040 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Pseudo Twirling Mitigation of Coherent Errors in non-Clifford Gates
The conventional circuit paradigm, utilizing a limited number of gates to construct arbitrary quantum circuits, is hindered by significant noise overhead. For instance, the standard gate paradigm employs two CNOT gates for the partial CPhase rotation in the quantum Fourier transform, even when the rotation angle is very small. In contrast, some quantum computer platforms can directly implement such operations using their native interaction, resulting in considerably shorter and less noisy imple…

This https://arxiv.org/abs/2307.15823 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Platinum-based Catalysts for Oxygen Reduction Reaction simulated with a Quantum Computer
Hydrogen has emerged as a promising energy source, holding the key to achieve low-carbon and sustainable mobility. However, its applications are still limited by modest conversion efficiency in the electrocatalytic oxygen reduction reaction (ORR) within fuel cells. Consequently, the development of novel catalysts and a profound understanding of the underlying reactions have become of paramount importance. The complex nature of the ORR potential energy landscape and the presence of strong electr…

This https://arxiv.org/abs/2402.14791 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Amplified Amplitude Estimation: Exploiting Prior Knowledge to Improve Estimates of Expectation Values
We provide a method for estimating the expectation value of an operator that can utilize prior knowledge to accelerate the learning process on a quantum computer. Specifically, suppose we have an operator that can be expressed as a concise sum of projectors whose expectation values we know a priori to be $O(ε)$. In that case, we can estimate the expectation value of the entire operator within error $ε$ using a number of quantum operations that scales as $O(1/\sqrtε)$. We then show how this c…

This https://arxiv.org/abs/2211.16097 has been replaced.
link: https://scholar.google.com/scholar?q=a

Variational Phase Estimation with Variational Fast Forwarding
Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained by a quantum computer. The recently proposed Variational Quantum Phase Estimation (VQPE) algorithm uses a basis of real time-evolved states, for which the energy eigenvalues can be obtained directly from the unitary matrix U = exp(-iHt), which can be computed…