Related papers: Testing product states, quantum Merlin-Arthur game…
In recent years, interest in expressing the success of neural networks to the quantum computing has increased significantly. Tensor network theory has become increasingly popular and widely used to simulate strongly entangled correlated…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
We address the "major open problem" of evaluating how much increased efficiency in estimation is possible using non-separable, as opposed to separable, measurements of N copies of m-level quantum systems. First, we study the six cases m =…
We investigate the performance of a quantum algorithm for solving classical 3-SAT problems. A cycle of post-selected measurements drives the computer's register monotonically toward a steady state which is correlated to the classical…
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle…
In measurement-based quantum computing an algorithm is performed by measurements on highly-entangled resource states. To date, several implementations were demonstrated, all of them assuming perfect noise-free environments. Here we consider…
We study detection of random signals corrupted by noise that over time switch their values (states) from a finite set of possible values, where the switchings occur at unknown points in time. We model such signals by means of a random…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
In this work, we study the sample complexity of two variants of product testing when restricted to single-copy measurements. In particular, we consider both bipartite product testing (i.e., does there exist at least one non-trivial cut…
Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish several complexity-theoretic results that classify the…
We study the relation between the maximal violation of Svetlichny's inequality and the mixedness of quantum states and obtain the optimal state (i.e., maximally nonlocal mixed states, or MNMS, for each value of linear entropy) to beat the…
Quantum circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. The ability to implement these with high accuracy in…
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…
The presence of noise in quantum computers hinders their effective operation. Even though quantum error correction can theoretically remedy this problem, its practical realization is still a challenge. Testing and benchmarking noisy,…
One of the key considerations in the development of Quantum Machine Learning (QML) protocols is the encoding of classical data onto a quantum device. In this chapter we introduce the Matrix Product State representation of quantum systems…
Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than…
We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…
We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key…
We give a quantum interactive proof system for the local Hamiltonian problem on n qubits in which (i) the verifier has a single round of interaction with five entangled provers, (ii) the verifier sends a classical message on O(log n) bits…
Qubit measurement is generally the most error-prone operation that degrades the performance of near-term quantum devices, and the exponential decay of readout fidelity severely impedes the development of large-scale quantum information…