Related papers: Recursive Path-Summing Simulation of Quantum Compu…
Modern cyberattacks are increasingly complex, posing significant challenges to classical machine learning methods, particularly when labeled data is limited and feature interactions are highly non-linear. In this study we investigates the…
Quantum simulation advantage over classical memory limitations would allow compact quantum circuits to yield insight into intractable quantum many-body problems, but the interrelated obstacles of large circuit depth in quantum time…
This work provides a rigorous and self-contained introduction to numerical methods for Hamiltonian simulation in quantum computing, with a focus on high-order product formulas for efficiently approximating the time evolution of quantum…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra classical communication channel, whose size depends only on…
Path integral-based simulation methodologies play a crucial role for the investigation of nuclear quantum effects by means of computer simulations. However, these techniques are significantly more demanding than corresponding classical…
High-performance classical simulator for quantum circuits, in particular the tensor network contraction algorithm, has become an important tool for the validation of noisy quantum computing. In order to address the memory limitations, the…
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} ,…
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…
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…
Understanding the computational overheads imposed by classical control systems on quantum computing platforms becomes critically important as these quantum machines grow in scale and complexity. In this work, we calculate the overheads…
How can we take inspiration from a typical quantum algorithm to design heuristics for machine learning? A common blueprint, used from Deutsch-Josza to Shor's algorithm, is to place labeled information in superposition via an oracle,…
Central to the power of quantum computing is the concept of quantum parallelism: quantum systems can explore and process multiple computational paths simultaneously. In this paper, we discuss the elusive nature of quantum parallelism,…
One of the key characteristics of secure quantum communication is quantum secure multiparty computation. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol that can be applied to many complex quantum operations.…
We propose a quantum-classical hybrid algorithm of the power method, here dubbed as quantum power method, to evaluate $\hat{\cal H}^n |\psi\rangle$ with quantum computers, where $n$ is a nonnegative integer, $\hat{\cal H}$ is a…
This paper presents a first end-to-end application of a Quantum Support Vector Machine (QSVM) algorithm for a classification problem in the financial payment industry using the IBM Safer Payments and IBM Quantum Computers via the Qiskit…
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.…
This work endeavors to juxtapose the efficacy of machine learning algorithms within classical and quantum computational paradigms. Particularly, by emphasizing on Support Vector Machines (SVM), we scrutinize the classification prowess of…
Quantum computing (QC) offers a new computing paradigm that has the potential to provide significant speedups over classical computing. Each additional qubit doubles the size of the computational state space available to a quantum…
In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli A and Rasetti M 2002, 2005a) relies on the (re)coupling theory of SU(2)…