Device-independent certification of a quantum gate requires the input and output tests to identify the same reference qubits. Self-testing the output Choi state alone does not guarantee this consistency. We develop a robust certification scheme for Boolean-phase gates, a broad family of computational-basis diagonal gates specified by Boolean functions. Boolean derivatives convert the target-dependent phase information into classical signs that can be evaluated from local measurement outcomes. This leads to Bell tests built from CHSH blocks using two binary measurements per party and no entangling measurements. At maximal violation, the tests self-test the normalized Choi state and the measured observables. Away from the maximum, they give an explicit affine lower bound on the extracted-state squared fidelity that is uniform over all Boolean functions and valid in arbitrary local dimensions. We then combine an identity test and a gate-output test in an independent-source network in which the reference devices use the same physical observables, obtaining a closed-form Choi-fidelity bound for an effective \(n\)-qubit channel. For CCZ, a joint six-party analysis gives a stronger robustness bound without changing the Bell expression or measurement settings. The construction shows how the algebraic structure of a gate can shift target-dependent information from quantum measurement design to classical processing of local outcomes.
It is confirmed that an ideal sequential and terminal measurement schedule delivers the same complete bit string distribution under matched causal operations, while normalized postselection can amplify perturbations inversely with prefix acceptance.
Bhvain Makwana, Kashyap Patel, Manjunath Joshi et al.· 0 citations
Complex solid-state systems are promising platforms for scalable, high-bandwidth quantum random-number generation, yet certifying the quantum origin of their fluctuations remains difficult because the underlying microscopic dynamics are hard to model and validate. Here we demonstrate semi-device-independent quantum ran...
Hamid Tebyanian, Marius Cizauskas, Manfred Bayer et al.· 0 citations
An absolutely entangled set (AES) is a collection of states for which at least one member remains entangled under any choice of global unitary transformation. We develop a semi-device-independent framework for certifying this property from dimensionally bounded prepare-and-measure correlations. A witness value above th...
Ram krishna Patra, A. Taoutioui, Tamás Vértesi· 0 citations
This work introduces magic-free certification, a certification protocol for universal fault-tolerant circuits that consumes no magic, the resource that generally places them beyond efficient classical simulation and is by far the most expensive element of a fault-tolerant computation.
G. Miguel, Shahram Panahiyan, D. Jaksch· 0 citations
Non-Clifford gates are essential for universal quantum computation, yet implementing them fault-tolerantly remains a central challenge for stabilizer codes. Here, we show how a syndrome degree of freedom can mediate a logical non-Clifford gate. Releasing one stabilizer check makes an additional logical qubit available...
Kishor Bharti, Tobias Haug, Andrew Tanggara· 0 citations
Certifying a quantum bound can require more information than realizing the correlations that attain it. We show that this distinction becomes unbounded when a proof must condition on one party's measurement question. A fixed Bell scenario attained by one entangled qubit pair has a standard degree-two sum-of-squares cer...
Fu-Min Wang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.