Related papers: Simulation of positive operator-valued measures an…

Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum states. However, the standard greedy algorithm, in general, cannot take the…

Many quantum algorithms rely on the measurement of complex quantum amplitudes. Standard approaches to obtain the phase information, such as the Hadamard test, give rise to large overheads due to the need for global controlled-unitary…

Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…

By quantum calibration we name an experimental procedure apt to completely characterize an unknown measurement apparatus by comparing it with other calibrated apparatuses. Here we show how to achieve the calibration of an arbitrary…

This review gives a survey of numerical algorithms and software to simulate quantum computers.It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation…

Accurate models for open quantum systems -- quantum states that have non-trivial interactions with their environment -- may aid in the advancement of a diverse array of fields, including quantum computation, informatics, and the prediction…

The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our…

A general method to mitigate the effect of errors in quantum circuits is outlined. The method is developed in sight of characteristics that an ideal method should possess and to ameliorate an existing method which only mitigates state…

Motivated by far-reaching applications ranging from quantum simulations of complex processes in physics and chemistry to quantum information processing, a broad effort is currently underway to build large-scale programmable quantum systems.…

Increasingly sophisticated programmable quantum simulators and quantum computers are opening unprecedented opportunities for exploring and exploiting the properties of highly entangled complex quantum systems. The complexity of large…

Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…

Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…

Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. DQCs can prepare certain long-range entangled states in constant depth, making them a promising route to preparing…

We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…

This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…

In this work we introduce a general scheme for measurement based quantum computation in continuous variables. Our approach does not necessarily rely on the use of ancillary cluster states to achieve its aim, but rather on the detection of a…

A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…

In this report we present a general approach for estimating quantum circuits by means of measurements. We apply the developed general approach for estimating the quality of superconducting and optical quantum chips. Using the methods of…

Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…

The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation…