114 citations · 544 across the 33 of their papers we have counts for
33 papers
Heisenberg scaling under collective non-parallel directional noise via geometric state design
Francisco Riberi, Lorenza Viola, Milad Marvian
Spin-squeezed states enable entanglement-enhanced frequency estimation; however, the achievable performance is limited in practice by decoherence. We study the problem of parameter…
Randomized Quantum Optimal Control
Leeseok Kim, Francisco Riberi, Kevin Baca +1
Quantum optimal control (QOC) aims to find control functions that optimally steer a quantum system toward a target operation. We introduce a \emph{randomized} QOC framework where o…
Robust high-order quantum simulation using finite-width pulses
Leeseok Kim, Milad Marvian
We present a general framework for promoting first-order pulse sequences in quantum simulation to higher-order sequences that maintain robustness in the presence of finite pulse-wi…
High-order dynamical decoupling in the weak-coupling regime
Leeseok Kim, Milad Marvian
We introduce a high-order dynamical decoupling (DD) scheme for arbitrary bounded system-bath interactions in the weak-coupling regime. Given any decoupling group that…
Higher-order Zeno sequences
Kasra Rajabzadeh Dizaji, Leeseok Kim, Milad Marvian +1
The quantum Zeno effect typically refers to freezing the dynamics of a quantum system through frequent observations. In general, quantum Zeno dynamics is obtained with an error of…
Universal Fault Tolerance with Non-Transversal Clifford Gates
Benjamin Anker, Milad Marvian
We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a gene…
Compressing Syndrome Measurement Sequences
Benjamin Anker, Milad Marvian
In this work, we analyze a framework for constructing fault-tolerant measurement schedules of varying lengths by combining stabilizer generators, and prove results about the distan…
Quantum algorithms based on quantum trajectories
Evan Borras, Milad Marvian
Quantum simulation has emerged as a key application of quantum computing, with significant progress made in algorithms for simulating both closed and open quantum systems. The simu…
Faster Randomized Dynamical Decoupling
Changhao Yi, Leeseok Kim, Milad Marvian
We present a randomized dynamical decoupling (DD) protocol that can improve the performance of any given deterministic DD, by using no more than two additional pulses. Our construc…
A quantum algorithm to simulate Lindblad master equations
Evan Borras, Milad Marvian
We present a quantum algorithm for simulating a family of Markovian master equations that can be realized through a probabilistic application of unitary channels and state preparat…
Fault-tolerant quantum computation using large spin cat-codes
Sivaprasad Omanakuttan, Vikas Buchemmavari, Jonathan A. Gross +2
We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code, analogous to the continuous variable cat encod…
Improving the speed of variational quantum algorithms for quantum error correction
Fabio Zoratti, Giacomo De Palma, Bobak Kiani +4
We consider the problem of devising a suitable Quantum Error Correction (QEC) procedures for a generic quantum noise acting on a quantum circuit. In general, there is no analytic u…
Flag Gadgets based on Classical Codes
Benjamin Anker, Milad Marvian
Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computations. While conventional methods use a number of extra qubits linear in the we…
Hamiltonian Quantum Generative Adversarial Networks
Leeseok Kim, Seth Lloyd, Milad Marvian
We propose Hamiltonian Quantum Generative Adversarial Networks (HQuGANs), to learn to generate unknown input quantum states using two competing quantum optimal controls. The game-t…
Limitations of variational quantum algorithms: a quantum optimal transport approach
Giacomo De Palma, Milad Marvian, Cambyse Rouzé +1
The impressive progress in quantum hardware in the last years has raised the interest of the quantum computing community in harvesting the computational power of such devices. Howe…
Hamiltonian singular value transformation and inverse block encoding
Seth Lloyd, Bobak T. Kiani, David R. M. Arvidsson-Shukur +5
The quantum singular value transformation is a powerful quantum algorithm that allows one to apply a polynomial transformation to the singular values of a matrix that is embedded a…
Error mitigation via stabilizer measurement emulation
A. Greene, M. Kjaergaard, M. E. Schwartz +16
Dynamical decoupling (DD) is a widely-used quantum control technique that takes advantage of temporal symmetries in order to partially suppress quantum errors without the need reso…
Learning quantum data with the quantum Earth Mover's distance
Bobak Toussi Kiani, Giacomo De Palma, Milad Marvian +2
Quantifying how far the output of a learning algorithm is from its target is an essential task in machine learning. However, in quantum settings, the loss landscapes of commonly us…
Quantum algorithm for nonlinear differential equations
Seth Lloyd, Giacomo De Palma, Can Gokler +5
Quantum computers are known to provide an exponential advantage over classical computers for the solution of linear differential equations in high-dimensional spaces. Here, we pres…
Quantum advantage for differential equation analysis
Bobak T. Kiani, Giacomo De Palma, Dirk Englund +3
Quantum algorithms for both differential equation solving and for machine learning potentially offer an exponential speedup over all known classical algorithms. However, there also…
The Quantum Wasserstein Distance of Order 1
Giacomo De Palma, Milad Marvian, Dario Trevisan +1
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of qudits. The proposal recovers the Hamming distance for the vectors of the canonical…
Termwise versus globally stoquastic local Hamiltonians: questions of complexity and sign-curing
Marios Ioannou, Stephen Piddock, Milad Marvian +2
We elucidate the distinction between global and termwise stoquasticity for local Hamiltonians and prove several complexity results. We show that the stoquastic local Hamiltonian pr…
Quantum polar decomposition algorithm
Seth Lloyd, Samuel Bosch, Giacomo De Palma +5
The polar decomposition for a matrix is , where is a positive Hermitian matrix and is unitary (or, if is not square, an isometry). This paper shows that the a…
Programming a quantum computer with quantum instructions
Morten Kjaergaard, Mollie E. Schwartz, Ami Greene +20
The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and p…