Credible enough? Forward guidance and perceived National Bank of Poland’s policy rule

Credible forward guidance should bring down the perceived impact of macroeconomic variables on the interest rate. Using a micro-level dataset we test the perception of monetary policy in Poland among professional forecasters and find evidence for forward guidance credibility

The decay of quantum correlations between quantum dot spin qubits and the characteristics of its magnetic field dependence

We address the question of the role of quantum correlations beyond entanglement in context of quantum magnetometry. To this end, we study the evolution of the quantum discord, measured by the rescaled discord, of two electron-spin qubits interacting with an environment of nuclear spins via the hyperfine interaction. We have found that depending on the initial state the evolution can or cannot display indifferentiability points in its time-evolution (due to the energy conservation law), as well as non-trivial dependence on inter-qubit phase. Furthermore, we show that for initial Bell states, quantum correlations display a strong magnetic-field sensitivity which can be utilized for decoherence-driven measurements of the external magnetic field. The potential discord-based measurement is sensitive to a wider range of magnetic field values than the entanglement-based measurement. In principle, entanglement is not a necessary resource for reliable decoherence-driven measurement, while the presence of quantum correlations beyond entanglement is.Comment: 9 pages, 6 figure

Quantum-state transfer in spin chains via isolated resonance of terminal spins

We propose a quantum-state transfer protocol in a spin chain that requires only the control of the spins at the ends of the quantum wire. The protocol is to a large extent insensitive to inhomogeneity caused by local magnetic fields and perturbation of exchange couplings. Moreover, apart from the free evolution regime, it allows one to induce an adiabatic spin transfer, which provides the possibility of performing the transfer on demand. We also show that the amount of information leaking into the central part of the chain is small throughout the whole transfer process (which protects the information sent from being eavesdropped) and can be controlled by the magnitude of the external magnetic field.Comment: 7 pages, 5 figures. Published versio

Tight Euler tours in uniform hypergraphs - computational aspects

By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed modulo $s$) and the sets $e_i$ for $i=0,\ldots,s-1$ are pairwise different. A tight tour in $H$ is a tight Euler tour if it contains all edges of $H$. We prove that the problem of deciding if a given $3$-uniform hypergraph has a tight Euler tour is NP-complete, and that it cannot be solved in time $2^{o(m)}$ (where $m$ is the number of edges in the input hypergraph), unless the ETH fails. We also present an exact exponential algorithm for the problem, whose time complexity matches this lower bound, and the space complexity is polynomial. In fact, this algorithm solves a more general problem of computing the number of tight Euler tours in a given uniform hypergraph