Related papers: Some Remarks on Quantum Brachistochrone
Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing as a feasibility problem for the Hamiltonian model and then solving…
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
The bare bones of a theory of quantum gravity are exposed. It may have the potential to solve the cosmological constant problem. Less certain is its behavior in the Newtonian limit.
One of the basic peoblems of quantum cosmology is the problem of time. Various solutions have been proposed for this problem. One approach is to use the Bohmian time. Another Approach is to use the probabilistic time which was recently…
Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…
Recently a stochastic underpinning for space time has been considered, what may be called Quantized Fractal Space Time. This leads us to a number of very interesting consequences which are testable, and also provides a rationale for several…
It is generally assumed that a Hamiltonian for a physically acceptable quantum system (one that has a positive-definite spectrum and obeys the requirement of unitarity) must be Hermitian. However, a PT-symmetric Hamiltonian can also define…
We study quantum brachistochrone problem for the spin-1 system in a magnetic field of a constant absolute value. Such system gives us a possibility to examine in detail the statement of papers [A. Carlini {\it et al.}, Phys. Rev. Lett. {\bf…
We present a panoramic view on various attempts to "solve" the problems of quantum measurement and macro-objectivation, i.e. of the transition from a probabilistic quantum mechanic microscopic world to a deterministic classical macroscopic…
Based on some results on reparmetrisation of time in Hamiltonian path integral formalism, a pseudo time formulation of operator formalism of quantum mechanics is presented. Relation of reparametrisation of time in quantum with super…
In the canonical approach to quantization of gravity, one often uses relational clock variables and an interpretation in terms of conditional probabilities to overcome the problem of time. In this essay we show that these suffer from…
In this talk, we give a glimpse of the problems with quantum gravity and some possible solutions.
This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate…
We present a brief review of physical problems leading to indefinite Hilbert spaces and non-hermitian Hamiltonians. With the exception of pseudo-Riemannian manifolds in GR, the problem of a consistent physical interpretation of these…
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…
We study the quantum entanglement and separability of Hermitian and pseudo-Hermitian systems of identical bosonic or fermionic particles with point interactions. The separability conditions are investigated in detail.
Quantum canonical transformations of the second kind and the non-Hermitian realizations of the basic canonical commutation relations are investigated with a special interest in the generalization of the conventional ladder operators. The…
The time-dependent pseudo-Hermitian formulation of quantum mechanics allows to study open system dynamics in analogy to Hermitian quantum systems. In this setting, we show that the notion of holonomic quantum computation can equally be…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
The paper defends the thesis that analysis of truth problem in the context of interpretations of quantum logic allows to reveal the prospect of elicitation of specifics of the relations between quantum mechanics and quantum logic in a…