Related papers: Efficient growth of complex graph states via imper…

Graph embedding is a recurrent problem in quantum computing, for instance, quantum annealers need to solve a minor graph embedding in order to map a given Quadratic Unconstrained Binary Optimization (QUBO) problem onto their internal…

A common technique for checking properties of complex state machines is to build a finite abstraction then check the property on the abstract system -- where a passing check on the abstract system is only transferred to the original system…

Preparation of a non-classically correlated state is the first step of any quantum-enhanced interferometric protocol. An efficient method is the one-axis twisting, which entangles a collection of initially uncorrelated particles by means of…

We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…

We consider the quantum memory assisted quantum state verification task, where an adversary prepare independent multipartite entangled states and send to the local verifiers, who then store several copies in the quantum memory and measure…

On the basis of generations of 1-dimensional and 2-dimensional graph states, we generate a 3-dimensional N3-qubit graph state based on the Josephson charge qubits. Since any two charge qubits can be selectively and effectively coupled by a…

We investigate the non-local properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state…

We consider the generation of photonic graph states in a linear optics setting where sequential non-deterministic fusion measurements are used to build large graph states out of small linear clusters and develop a framework to optimize the…

High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…

Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…

The fidelity estimation between two quantum states is crucial for quantum computation and information science. However, an efficacious method for this, especially for mixed states and higher-dimensional density matrices, remains elusive.…

Multimode Gaussian states are a versatile resource for quantum information technologies and have been realized across a wide range of physical platforms. Recent progress in the large-scale generation of such states provides a key ingredient…

Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In…

Measurements are central in all quantitative sciences, and a fundamental challenge is to make observations without systematic measurement errors. This holds in particular for quantum information processing, where other error sources, such…

In the current work we address the problem of quantum process tomography (QPT) in the case of imperfect preparation and measurement of the states which are used for QPT. The fuzzy measurements approach which helps us to efficiently take…

Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…

We show that iteration of a few ( $\sim N^{1/4}$) unitary steps of Grover's algorithm suffices to perfectly prepare a Dicke state of $N$ atoms in a cavity. We also show that a few subsequent Grover steps can be employed to generate GHZ and…

This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…

Quantum annealers offer an efficient way to compute high quality solutions of NP-hard problems when expressed in a QUBO (quadratic unconstrained binary optimization) or an Ising form. This is done by mapping a problem onto the physical…

Entanglement purification describes a primitive in quantum information processing, where several copies of noisy quantum states are distilled into few copies of nearly-pure states of high quality via local operations and classical…