RESUMEN
This study aimed to identify evaluation items that can be used to create an index to evaluate caregivers' fear of care recipient falls. A three-round Delphi method was conducted with medical professionals engaged in discharge support for patients with fall-related fractures. In the first round, a working group brainstormed evaluation items. In the second and third rounds, opinions of medical professionals were quantified and evaluation items were refined. The Delphi method showed convergence of opinion with Kendall's W of 0.561 in the third round. Of the 109 evaluation items pooled in the first round, the consensus was reached on the importance of 19 items and one more item was additionally included. The 20 items may be useful for creating an index that sensitively measures caregivers' fear of care recipient falls.
Asunto(s)
Cuidadores , Miedo , Humanos , Técnica Delphi , Encuestas y CuestionariosRESUMEN
One of the major challenges for erroneous quantum computers is undoubtedly the control over the effect of noise. Considering the rapid growth of available quantum resources that are not fully fault tolerant, it is crucial to develop practical hardware-friendly quantum error mitigation (QEM) techniques to suppress unwanted errors. Here, we propose a novel generalized quantum subspace expansion method which can handle stochastic, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian, without relying on any information of noise. The performance of our method is discussed under two highly practical setups: the quantum subspaces are mainly spanned by powers of the noisy state ρ^{m} and a set of error-boosted states, respectively. We numerically demonstrate in both situations that we can suppress errors by orders of magnitude, and show that our protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.
RESUMEN
In order to realize fault-tolerant quantum computation, a tight evaluation of the error threshold under practical noise models is essential. While non-Clifford noise is ubiquitous in experiments, the error threshold under non-Clifford noise cannot be efficiently treated with known approaches. We construct an efficient scheme for estimating the error threshold of the one-dimensional quantum repetition code under non-Clifford noise. To this end, we employ the nonunitary free-fermionic formalism for efficient simulation of the one-dimensional repetition code under coherent noise. This allows us to evaluate the effect of coherence in noise on the error threshold without any approximation. The result shows that the error threshold becomes one-third when the noise is fully coherent. Our scheme is also applicable to the surface code undergoing a specific coherent noise model. The dependence of the error threshold on noise coherence can be explained with a leading-order analysis with respect to coherence terms in the noise map. We expect that this analysis is also valid for the surface code since it is a two-dimensional extension of the one-dimensional repetition code. Moreover, since the obtained threshold is accurate, our results can be used as a benchmark for the approximation or heuristic schemes for non-Clifford noise.