arXiv subjects

Yiğit Subaşı

Publications and source records attributed to Yiğit Subaşı.

9 recordsLinked to original sources

arXiv2026

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. [Subaşi et al., Phys. Rev. Lett. (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number $κ$ of the linear system and the target error $ε$. Here we go beyond these results in several ways. Firstly, using filtering~[Lin et al., Quantum (2019)] and Poissonization techniques [Cunningham et al., arXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling $O(κ\log(1/ε))$ -- an exponential improvement in $ε$, and a shaving of a $\log κ$ scaling factor in $κ$. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation -- which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is $837 κ$ at $ε=10^{-10}$ for Hermitian matrices.

quant-ph↗

arXiv2025

Quantum Approximate Counting with Additive Error: Hardness and Optimality

Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number of valid solutions to NP problems -- a problem well-studied in theoretical computer science with far-reaching implications in computational complexity. The complexity of solving the class #BQP of quantum counting problems, either exactly or within suitable approximations, is related to the hardness of computing many-body physics quantities arising in algebraic combinatorics. Here, we address the complexity of quantum approximate counting under additive error. First, we show that computing additive approximations to #BQP problems to within an error exponential in the number of witness qubits in the corresponding verifier circuit is as powerful as polynomial-time quantum computation. Next, we show that returning an estimate within error that is any smaller is #BQP-hard. Finally, we show that additive approximations to a restricted class of #BQP problems are equivalent in computational hardness to the class DQC1. Our work parallels results on additively approximating #P and GapP functions.

quant-ph↗

arXiv2024

Limitations for Quantum Algorithms to Solve Turbulent and Chaotic Systems

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.

quant-ph↗

arXiv2024

Challenges for quantum computation of nonlinear dynamical systems using linear representations

A number of recent studies have proposed that linear representations are appropriate for solving nonlinear dynamical systems with quantum computers, which fundamentally act linearly on a wave function in a Hilbert space. Linear representations, such as the Koopman representation and Koopman von Neumann mechanics, have regained attention from the dynamical-systems research community. Here, we aim to present a unified theoretical framework, currently missing in the literature, with which one can compare and relate existing methods, their conceptual basis, and their representations. We also aim to show that, despite the fact that quantum simulation of nonlinear classical systems may be possible with such linear representations, a necessary projection into a feasible finite-dimensional space will in practice eventually induce numerical artifacts which can be hard to eliminate or even control. As a result, a practical, reliable and accurate way to use quantum computation for solving general nonlinear dynamical systems is still an open problem.

quant-ph↗

arXiv2023

On nonlinear transformations in quantum computation

While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical post-processing.

quant-ph↗

arXiv2022

Ancilla-free continuous-variable SWAP test

We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the computational basis measurement is replaced by photon number-resolving measurement, and we calculate an upper bound on the error of the overlap estimate obtained from a finite Fock cutoff in the detector. As an example, we show that estimation of the overlap of pure, centered, single-mode Gaussian states of energy $E$ and squeezed in opposite quadratures can be obtained to error $ε$ using photon statistics below a Fock basis cutoff $O(E\ln ε^{-1})$. This cutoff is greatly reduced to $E + O(\sqrt{E}\ln ε^{-1})$ when the states have rapidly decaying Fock tails, such as coherent states. We show how the ancilla-free CV SWAP test can be extended to many modes and applied to quantum algorithms such as variational compiling and entanglement spectroscopy in the CV setting. For the latter we also provide a new algorithm which does not have an analog in qubit systems. The ancilla-free CV SWAP test is implemented on Xanadu's 8-mode photonic processor in order to estimate the vacuum probability of a two-mode squeezed state.

quant-ph↗

arXiv2021

Dissipative dynamics of a particle coupled to field via internal degrees of freedom

We study the non-equilibrium dissipative dynamics of the center of mass of a particle coupled to a field via its internal degrees of freedom. We model the internal and external degrees of freedom of the particle as quantum harmonic oscillators in 1+1 D, with the internal oscillator coupled to a scalar quantum field at the center of mass position. Such a coupling results in a nonlinear interaction between the three pertinent degrees of freedom -- the center of mass, internal degree of freedom, and the field. It is typically assumed that the internal dynamics is decoupled from that of the center of mass owing to their disparate characteristic time scales. Here we use an influence functional approach that allows one to account for the self-consistent backaction of the different degrees of freedom on each other, including the coupled non-equilibrium dynamics of the internal degree of freedom and the field, and their influence on the dissipation and noise of the center of mass. Considering a weak nonlinear interaction term, we employ a perturbative generating functional approach to derive a second order effective action and a corresponding quantum Langevin equation describing the non-equilibrium dynamics of the center of mass. We analyze the resulting dissipation and noise arising from the field and the internal degree of freedom as a composite environment. Furthermore, we establish a generalized fluctuation-dissipation relation for the late-time dissipation and noise kernels. Our results are pertinent to open quantum systems that possess intermediary degrees of freedom between system and environment, such as in the case of optomechanical interactions.

quant-ph↗

arXiv2018

Learning the quantum algorithm for state overlap

Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap ${\rm Tr}(ρσ)$ between two quantum states $ρ$ and $σ$. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to $ρ= σ$, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has a constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate sets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error - compared to the Swap Test - on these computers.

quant-ph↗

arXiv2016

Fast forward to the classical adiabatic invariant

We show how the classical action, an adiabatic invariant, can be preserved under non-adiabatic conditions. Specifically, for a time-dependent Hamiltonian $H = p^2/2m + U(q,t)$ in one degree of freedom, and for an arbitrary choice of action $I_0$, we construct a "fast-forward" potential energy function $V_{\rm FF}(q,t)$ that, when added to $H$, guides all trajectories with initial action $I_0$ to end with the same value of action. We use this result to construct a local dynamical invariant $J(q,p,t)$ whose value remains constant along these trajectories. We illustrate our results with numerical simulations. Finally, we sketch how our classical results may be used to design approximate quantum shortcuts to adiabaticity.

physics.class-ph↗