Related papers: Quantum State Engineering Under Multiple Expectati…
Distinguishing different quantum states is a fundamental task having practical applications for information processing. Despite the efforts devoted so far, however, strategies for optimal discrimination are known only for specific examples.…
This thesis addresses the problem of developing a quantum counter-part of the well established classical theory of control. We dwell on the fundamental fact that quantum states are generally not perfectly distinguishable, and quantum…
Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap to the…
Variational quantum algorithms is one of the most representative algorithms in quantum computing, which has a wide range of applications in quantum machine learning, quantum simulation and other related fields. However, they face challenges…
Understanding the properties of excited states of complex molecules is crucial for many chemical and physical processes. Calculating these properties is often significantly more resource-intensive than calculating their ground state…
Quantum states with nonlinear squeezing are a necessary resource for deterministic implementation of high-order quadrature phase gates that are, in turn, sufficient for advanced quantum information processing. We demonstrate that this class…
Quantum computation is a subject of much theoretical promise, but has not been realized in large scale, despite the discovery of fault-tolerant procedures to overcome decoherence. Part of the reason is that the theoretically modest…
In this work, a scalable algorithm for the approximate quantum state preparation problem is proposed, facing a challenge of fundamental importance in many topic areas of quantum computing. The algorithm uses a variational quantum circuit…
Control strategies for dissipative preparation of target quantum states, both pure and mixed, and subspaces are obtained by switching between a set of available semigroup generators. We show that the class of problems of interest can be…
Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure,…
The important problem of how to prepare a quantum mechanical system, $S$, in a specific initial state of interest - e.g., for the purposes of some experiment - is addressed. Three distinct methods of state preparation are described. One of…
Inspired by the advancements in large language models based on transformers, we introduce the transformer quantum state (TQS): a versatile machine learning model for quantum many-body problems. In sharp contrast to Hamiltonian/task specific…
We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms we…
Quantum coherence profoundly alters classical thermodynamic expectations by modifying the structure and accessibility of probability distributions. Classically, transitions to lower-entropy states (local second-law violations) are…
Excited states of many-body quantum systems play a key role in a wide range of physical and chemical phenomena. Unlike ground states, for which many efficient variational techniques exist, there are few ways to systematically construct…
Quantum noise constitutes a fundamental obstacle to realizing practical quantum technologies. To address the pivotal challenge of identifying quantum systems least affected by noise, we introduce the purest quantum state identification,…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
We apply the time-dependent decoherence-free subspace theory to a Markovian open quantum system in order to present a novel proposal for quantum-state engineering program. By quantifying the purity of the quantum state, we verify that the…
We consider the problem of deciding whether a given state preparation, i.e., a source of quantum states, is accurate, namely produces states close to a target one within a prescribed threshold. We show that, when multiple measurements need…
A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers - and even early fault-tolerant quantum…