Related papers: The duality-character Solution-Information-Carryin…
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the…
Quantum Hamiltonian identification is important for characterizing the dynamics of quantum systems, calibrating quantum devices and achieving precise quantum control. In this paper, an effective two-step optimization (TSO) quantum…
In information transfer, the dissipation of a signal may have crucial importance. The feasibility of reconstructing the distorted signal also depends on this. That is why the study of quantized dissipative transversal single particle…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
Characterization of quantum dynamics is a fundamental problem in quantum physics and quantum information science. Several methods are known which achieve this goal, namely Standard Quantum Process Tomography (SQPT), Ancilla-Assisted Process…
Is it possible to infer the time evolving quantum state of a multichromophoric system from a sequence of two-dimensional electronic spectra (2D-ES) as a function of waiting time? Here we provide a positive answer for a tractable model…
An all optical implementation of quantum information processing with semiconductor macroatoms is proposed. Our quantum hardware consists of an array of semiconductor quantum dots and the computational degrees of freedom are energy-selected…
This thesis focuses on quantum information processing using the superconducting device, especially, on realizing quantum gates and algorithms in open quantum systems. Such a device is constructed by transmon-type superconducting qubits…
The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental…
Consider the unstructured search of an unknown number l of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover's…
This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.
The next generation of distributed quantum processors combines single-location quantum computing and quantum networking techniques to permit large entangled qubit groups to be established through remote processors, and quantum algorithms…
Quantum-selected configuration interaction (QSCI) is an approach for quantum chemical calculations using current quantum computers. In conventional QSCI, Slater determinants used for the wave function expansion are sampled by iteratively…
In this paper, building on a previous analysis [1] of exact diagonalization of the space-discretized evolution operator for the study of properties of non-relativistic quantum systems, we present a substantial improvement to this method. We…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
Discrimination of unitary operations is a fundamental quantum information processing task. Assisted with linear optical elements, we experimentally demonstrate perfect discrimination between single-bit unitary operations using two…
Having a broad range of methods available for implementing unitary operations is crucial for quantum information tasks. We study a dissipative process commonly used to describe dissipatively coupled systems and show that the process can…
A quantum mechanical description of particle propagation on the discrete spacetime of a causal set is presented. The model involves a discrete path integral in which trajectories within the causal set are summed over to obtain a particle…
An original entity is defined to study quantum beams of conserved particles. The beam is described as a Stationary Incoherent Superposition of Wave packets (SISOW). Mean values are time-independent confirming that the SISOW describes a…