Related papers: Finding the optimal cluster state configuration. M…

Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…

We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be…

We present for the first time a general theory of error correction for permutation invariant (PI) codes. Using representation theory of the symmetric group we construct efficient algorithms that can correct any correctible error on any PI…

Recently, a framework was established to systematically construct novel universal resource states for measurement-based quantum computation using techniques involving finitely correlated states. With these methods, universal states were…

The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…

We present a theoretical framework for state-adaptive quantum error correction that bridges the gap between quantum computing and error correction paradigms. By incorporating knowledge of quantum states into the error correction process, we…

We consider the problem of minimum-error quantum state discrimination for single-qubit mixed states. We present a method which uses the Helstrom conditions constructively and analytically; this algebraic approach is complementary to…

In quantum state discrimination, one aims to identify unknown states from a given ensemble by performing measurements. Different strategies such as minimum-error discrimination or unambiguous state identification find different optimal…

Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…

Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible…

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…

The cloning of continuous quantum variables is analyzed based on the concept of Gaussian cloning machines, i.e., transformations that yield copies that are Gaussian mixtures centered on the state to be copied. The optimality of Gaussian…

Using the necessary and sufficient conditions, minimum error discrimination among two sets of similarity transformed equiprobable quantum qudit states is investigated. In the case that the unitary operators are generating sets of two…

Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable.…

The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible…

We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade-offs between the number of physical qubits and the fault-tolerant execution time of a…

We address the question of optimality of entangled input states in quantum Gaussian memory channels. For a class of such channels, that can be traced back to the memoryless setting, we state a criterion which relate the optimality of…

Highly entangled states called cluster states are a universal resource for measurement-based quantum computing (QC). Here we propose an efficient method for producing large cluster states using superconducting quantum circuits. We show that…

We propose a numerical algorithm for finding optimal measurements for quantum-state discrimination. The theory of the semidefinite programming provides a simple check of the optimality of the numerically obtained results.

We present a quantum algorithm for finding the minimum of a function based on multistep quantum computation and apply it for optimization problems with continuous variables, in which the variables of the problem are discretized to form the…