Related papers: Quantum Approximation of Normalized Schatten Norms…
A key component of a quantum machine learning model operating on classical inputs is the design of an embedding circuit mapping inputs to a quantum state. This paper studies a transfer learning setting in which classical-to-quantum…
We propose to apply the notion of the Schmidt number in order to show that a quantum memory or gate process is capable of maintaining a genuine multi-level quantum coherence. We present a simple criterion in terms of an average gate…
In this paper, we show that $\Theta(\mathrm{poly}(n)\cdot\frac{4^n}{\epsilon^2})$ is the sample complexity of testing whether two $n$-qubit quantum states $\rho$ and $\sigma$ are identical or $\epsilon$-far in trace distance using…
Suppose N parties describe the state of a quantum system by N possibly different density operators. These N state assignments represent the beliefs of the parties about the system. We examine conditions for determining whether the N state…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
The phase-space quasi-probability distribution formalism for representing quantum states provides practical tools for various applications in quantum optics such as identifying the nonclassicality of quantum states. We study filter…
In quantum metrology, one of the major applications of quantum technologies, the ultimate precision of estimating an unknown parameter is often stated in terms of the Cram\'er-Rao bound. Yet, the latter is no longer guaranteed to carry an…
We consider the classic question of state tomography: given copies of an unknown quantum state $\rho\in\mathbb{C}^{d\times d}$, output $\widehat{\rho}$ which is close to $\rho$ in some sense, e.g. trace distance or fidelity. When one is…
Quantum machine learning models are designed for performing learning tasks. Some quantum classifier models are proposed to assign classes of inputs based on fidelity measurements. Quantum Hadamard test is a well-known quantum algorithm for…
Standard approaches to quantum statistical inference rely on measurements that induce a collapse of the wave function, effectively consuming the quantum state to extract information. In this work, we investigate the fundamental limits of…
This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group -- often called `complexity geometries' following the definition of…
In quantum/wave systems with chaotic classical analogs, wavefunctions evolve in highly complex, yet deterministic ways. A slight perturbation of the system, though, will cause the evolution to diverge from its original behavior increasingly…
In this work, we initiate the study of learning quantum processes from quantum statistical queries. We focus on two fundamental learning tasks in this new access model: shadow tomography of quantum processes and process tomography with…
Anomaly detection is a vital technique for exploring signatures of new physics Beyond the Standard Model (BSM) at the Large Hadron Collider (LHC). The vast number of collisions generated by the LHC demands sophisticated deep learning…
The Schmidt numbers quantify the entanglement degree of quantum states. Quantum states with high Schmidt numbers provide a larger advantage in various quantum information processing tasks compared to quantum states with low Schmidt numbers.…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…
Fault-tolerant quantum computation requires non-destructive quantum measurements with classical feed-forward. Many experimental groups are actively working towards implementing such capabilities and so they need to be accurately evaluated.…
We relate gate fidelities of experimentally realized quantum operations to the broadcasting property of their ideal operations, and show that the more parties a given quantum operation can broadcast to, the higher gate fidelities of its…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…