Related papers: Solving approximate hidden subgroup problems: quan…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
The design and performance of computer vision algorithms are greatly influenced by the hardware on which they are implemented. CPUs, multi-core CPUs, FPGAs and GPUs have inspired new algorithms and enabled existing ideas to be realized.…
Quantum error detection has always been a fundamental challenge in a fault-tolerant quantum computer. Hence, it is of immense importance to detect and deal with arbitrary errors to efficiently perform quantum computation. Several error…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
We present a framework that formulates the quest for the most efficient quantum state tomography scheme as an optimization problem which can be solved numerically. This approach can be applied to a broad spectrum of relevant setups…
To accelerate the algorithms for the dihedral hidden subgroup problem, we present a new algorithm based on algorithm SV(shortest vector). A subroutine is given to get a transition quantum state by constructing a phase filter function, then…
One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
We introduce an experimental procedure for the detection of quantum entanglement of an unknown quantum state with as few measurements as possible. The method requires neither a priori knowledge of the state nor a shared reference frame…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The…
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…
We revisit the problem of detection of entanglement of an unknown two-qubit state using minimal resources. Using weak values and just two copies of an arbitrary two-qubit state, we present a protocol where a post selection measurement in…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
In quantum information theory, the reliable and effective detection of entanglement is of paramount importance. However, given an unknown state, assessing its entanglement is a challenging task. To attack this problem, we investigate the…
In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of…
Recently, a technique known as quantum symmetry test has gained increasing attention for detecting bipartite entanglement in pure quantum states. In this work we show that, beyond qualitative detection, a family of well-defined measures of…
We review a geometric approach to classification and examination of quantum correlations in composite systems. Since quantum information tasks are usually achieved by manipulating spin and alike systems or, in general, systems with a finite…
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled…
Quantum annealing promises to be an effective heuristic for complex NP-hard problems. However, clear demonstrations of quantum advantage are wanting, primarily constrained by the difficulty of embedding the problem into the quantum…