Results 11 to 20 of about 1,659,955 (202)
Constant-overhead magic state distillation [PDF]
Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states required per output magic state with an error rate below $ε$, typically grows as $\mathcal{O}(\log^γ(1/ε))$.
Adam Wills +2 more
core +4 more sources
Orientable -distance magic regular graphs
Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
Fast Calculation of Cube and Inverse Cube Roots Using a Magic Constant and Its Implementation on Microcontrollers [PDF]
We develop a bit manipulation technique for single precision floating point numbers which leads to new algorithms for fast computation of the cube root and inverse cube root. It uses the modified iterative Newton–Raphson method (the first order of convergence) and Householder method (the second order of convergence) to increase the accuracy of the ...
Leonid Moroz +3 more
openaire +2 more sources
Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs [PDF]
Let 𝐻 be a hypergraph with a vertex set 𝑉 and a hyperedge set 𝐸. Generalized from the super edge-magic in a graph, we say that a hypergraph 𝐻 is super edge-magic if there is a bijection 𝑓: 𝑉 ∪ 𝐸 → {1,2,3, … , |𝑉| + |𝐸|} which satisfies: (i) there exists
Ratinan Boonklurb +2 more
doaj +1 more source
Modified Fast Inverse Square Root and Square Root Approximation Algorithms: The Method of Switching Magic Constants [PDF]
Many low-cost platforms that support floating-point arithmetic, such as microcontrollers and field-programmable gate arrays, do not include fast hardware or software methods for calculating the square root and/or reciprocal square root. Typically, such functions are implemented using direct lookup tables or polynomial approximations, with a subsequent ...
Leonid V. Moroz +2 more
openaire +3 more sources
Some properties of magSome Properties of Magic Squares of Distinct Squares and Cubesic squares
Magic squares is n×n matrix with positive integer entries as well as the sum of rows, columns and mains diagonal have the same magic constant, one of the most oldest magic square was discovered in china.
amal Abdulrahman Ibrahim +1 more
doaj +1 more source
A Modification of the Fast Inverse Square Root Algorithm
We present a new algorithm for the approximate evaluation of the inverse square root for single-precision floating-point numbers. This is a modification of the famous fast inverse square root code.
Cezary J. Walczyk +2 more
doaj +1 more source
Magic of quantum hypergraph states [PDF]
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing.
Junjie Chen, Yuxuan Yan, You Zhou
doaj +1 more source
Further results on (1,0,0)-F-Face magic mean graphs [PDF]
A (1,0,0)-F-Face magic mean labeling is an assignment of labels to the vertices of planar graph such that the mean weight of each face including an exterior face is constant.
A. Meena Kumari, S. Arockiaraj
doaj +1 more source
Objective: We aimed to use adaptive psychophysics methods, which is a Bayesian Model, to measure users' time perception of various progress bar quantitatively. Background: Progress bar informs users about the status of ongoing processes. Progress bars frequently display nonuniform speed patterns, such as acceleration and deceleration.
Qihan Wang +2 more
openaire +3 more sources

