Related papers: State preparation based on quantum phase estimatio…
Mixed states of a quantum system, represented by density operators, can be decomposed as a statistical mixture of pure states in a number of ways where each decomposition can be viewed as a different preparation recipe. However the fact…
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has…
Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code space. Furthermore, to classify if the encoded information is…
Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of…
In large quantum systems multipartite entanglement can be found in many inequivalent classes under local operations and classical communication. Preparing states of arbitrary size in different classes is important for performing a wide…
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…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
Combining quantum computers with classical compute power has become a standard means for developing algorithms that are eventually supposed to beat any purely classical alternatives. While in-principle advantages for solution quality or…
The quantum channel decomposition techniques, which contain the so-called probabilistic error cancellation and gate/wire cutting, are powerful approach for simulating a hard-to-implement (or an ideal) unitary operation by concurrently…
The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the…
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the…
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to…
We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning…
Quantum Phase Estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of…
Long-range entangled states are vital for quantum information processing and quantum metrology. Preparing such states by combining measurements with unitary gates opened new possibilities for efficient protocols with finite-depth quantum…
To ensure resilience against the unavoidable noise in quantum computers, quantum information needs to be encoded using an error-correcting code, and circuits must have a particular structure to be fault-tolerant. Compilation of…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
We propose a deterministic remote state preparation scheme for photon polarization qubit states, where entanglement, local operations and classical communication are used. By consuming one maximally entangled state and two classical bits,…
We propose quantum algorithms for projective ground-state preparation and calculations of the many-body Green's functions directly in frequency domain. The algorithms are based on the linear combination of unitary (LCU) operations and…