{"id":"75c1d0e3-5dfe-4fb5-8735-7cacc92b37c6","arxiv_id":"2506.15909","paper_version":1,"verdict":"UNVERDICTED","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A pedagogical paper presents quantum circuit activities for teaching no-signalling, Landauer erasure, and closed-timelike-curve computational power, drawing content from known results.","lead":"This paper proposes three classroom-ready quantum circuits that illustrate relativity, thermodynamics, and time-travel paradoxes on current quantum hardware. It is a useful teaching resource for connecting quantum computing with foundational physics, rather than a new scientific result.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The CTC activity hardcodes the consistency condition via classical user input, so the claimed test of CTC computational power is a lookup table, not a simulation.","rationale":"After reading the manuscript in good faith, I find the same soft spot the reader identified. The CTC activity is the most ambitious of the three and the one where a learner could most easily be misled, because the circuit output is a deterministic function of the user's input once the time-loop qubit is prepared according to that input. The disclosure in IV-C1 is honest but does not repair the pedagogical claim: the activity does not let learners 'test' the fixed-point condition; it lets them verify that a hardcoded state produces the expected output. I do not see an internal inconsistency in the EPR or Szilard sections, and the EPR descriptor-based account is a legitimate, if nonstandard, educational framing. The absence of empirical evidence for the educational claim is a gap but not a falsification for an education paper. Because the reader already weighted the CTC-hardcoding red flag and chose UNVERDICTED, my assessment leaves that verdict unchanged. The proposed test—running the circuit with a fixed time-loop qubit or solving the fixed-point equation for a superposition input—would empirically decide whether the activity is a genuine simulation or a precomputed lookup table.","tokens_in":15368,"tokens_out":7000,"duration_ms":81716,"concrete_test":"Run the BB84 distinguishing circuit from Sec. IV-C2 on a simulator with the time-loop qubit prepared in the same fixed state |0> for all four inputs (|0>, |1>, |+>, |−>) instead of the consistency-condition state. If the outputs no longer uniquely identify the inputs, the circuit's distinguishing power comes entirely from the hardcoded preparation. Then compute the Deutsch fixed point for a superposition input such as (|0>+|−>)/√2; if the fixed-point equation ρ = tr1[U(|ψ><ψ| ⊗ ρ)U†] has no solution or the output is not the one the hardcoded code produces, the activity is a lookup table rather than a simulation of a closed timelike curve.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is that the outlined circuits help learners engage with foundational physics. A load-bearing sub-claim is in Sec. IV-C: learners 'can test directly how CTCs would give us access to computational power beyond that allowed by standard quantum theory' by using the circuit to distinguish non-orthogonal states. But the implementation in Sec. IV-C1 conditions the preparation of the time-loop qubit on the user's input state ('0' or '-'), which is exactly the state being distinguished. The paper acknowledges this: 'I have artificially introduced the non-linearity into the quantum circuits by making the preparation of the time-loop qubit depend on the user's input state.' Because the time-loop qubit is set to the already-solved fixed point, the output is fully determined by the input before any quantum evolution occurs. Learners therefore do not observe a CTC's nonlinear consistency condition; they observe a classical conditional that hardcodes the expected answer. This undermines the specific lesson about CTC computational power and, since the CTC activity is one of the three pedagogical pillars, weakens the overall claim that the activities give valid insight into the physics rather than a scripted demonstration.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper presents three quantum-circuit-based learning activities intended to help students engage with foundational physics: the EPR paradox and locality, a quantum Szilard engine and Landauer erasure, and simulations of closed timelike curves (CTCs) showing their purported computational power. The author provides the physics background, circuit constructions, and suggested extensions, with references to an accompanying video, blog, and code series. The paper's central claim is that these activities let learners test or demonstrate principles of special relativity, general relativity, and thermodynamics on current or near-term quantum computers.","tokens_in":15587,"tokens_out":5001,"duration_ms":56685,"significance":"If the activities work as claimed, they would be a valuable pedagogical resource, connecting quantum computing education to deep topics in physics. The descriptor-based local account of the EPR experiment in Section II-A is a clever and technically sound way to present locality without invoking Bell inequalities, and the Szilard engine activity in Section III correctly illustrates the role of a pure memory state and the necessity of erasure for cyclic work extraction. The CTC section accurately describes Deutsch's consistency condition and its computational consequences, but the central pedagogical claim about testing CTC power relies on a circuit that hardcodes the fixed point, which undermines the claimed 'test.' The paper is clearly written and provides accessible explanations with concrete Qiskit code snippets, which is a strength for an education-oriented audience.","major_comments":[{"comment":"The circuit implementation for distinguishing |0⟩ and |−⟩ determines the time-loop qubit's preparation from the user's input, as the author acknowledges. Because the user already knows which state is fed in, and the time-loop qubit is prepared in the state that makes the consistency condition trivially satisfied, the circuit does not simulate a CTC's nonlinear fixed-point search; it is a classical conditional that merely outputs the precomputed answer. The learner therefore does not 'test directly how CTCs would give us access to computational power beyond that allowed by standard quantum theory' as claimed in Section I. The activity would need either a genuine fixed-point search (for example, iteratively updating the time-loop qubit and checking consistency) or a clear reframing as an illustration of the fixed-point condition with an explicit statement that it provides no predictive test. This is load-bearing because the CTC activity is one of the three pillars of the paper's stated contribution.","section":"§IV-C1"},{"comment":"The BB84 extension inherits the same circularity: the outputs (00, 10, 01, 11) are hardwired to the four possible inputs, so the circuit does not demonstrate an eavesdropper's ability to distinguish non-orthogonal states; it merely encodes the known answer. The paper should state clearly that the circuit is a schematic for what a CTC would compute, not a simulation whose output can verify the claim. Suggest also discussing why a post-selection or iterative fixed-point simulation would be needed to make the activity a genuine test rather than a predetermined demonstration.","section":"§IV-C2"}],"minor_comments":[{"comment":"In the sentence 'it is impossible to soley turn heat', 'soley' should be 'solely'.","section":"§III-A"},{"comment":"In the preparation of the particle, 'superpostion' should be 'superposition'.","section":"§III-D1"},{"comment":"The word 'paramaterised' appears in the description of Figure 1; it should be 'parameterised' (or 'parameterized') for consistency with the rest of the text.","section":"§II-A"},{"comment":"In the sentence 'Figure 10 shows the quantum circuit when the user inputs 00', the input '00' does not match the listed states |0⟩, |1⟩, |+⟩, |−⟩; it should likely be '0' or '|0⟩'.","section":"§IV-C2"},{"comment":"The abstract and conclusion claim the activities can be run on current and near-term quantum computers, but no sample measurement statistics or demonstration outputs are included. Adding an example of actual output distributions for the EPR or Szilard circuits, even from a simulator, would strengthen the pedagogical demonstration.","section":"General"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This is a teaching paper, not a research paper, and it should be judged that way. The EPR section is a careful, faithful restatement of Deutsch–Hayden descriptors; the quantum Szilard engine is the most original part, mapping the thought experiment onto a qubit circuit in a way that could genuinely help students see why a blank memory matters. The citations are appropriate and the author is transparent about what is borrowed. Credit is due for that clarity.\n\nThe soft spot is the CTC activity, and it is load-bearing. The circuit does not simulate a closed timelike curve; it asks the user which non-orthogonal state was sent, then prepares the time-loop qubit in the already-computed fixed point. The output is determined before any quantum evolution. That is a lookup table, not a demonstration of the nonlinear consistency condition. The paper acknowledges this in Section IV-C1, which is honest, but the acknowledgment does not make the pedagogical claim true. A learner using this circuit does not test CTC computational power; they test whether the author coded the known answer correctly. That specific lesson needs to be re-framed or replaced.\n\nThe other sections hold up. The Szilard circuit correctly illustrates the role of erasure, and the paper explicitly notes that energy conservation is not modeled. For a classroom activity, that limitation is minor and appropriately flagged. The absence of run data and learning-outcome assessment is typical for a proposed activity, though a serious education paper would benefit from at least some example outputs or instructor observations. The code is in linked external tutorials, which is fine for a companion paper but weakens the manuscript if it needs to stand alone.\n\nWho gets value from this? Educators building quantum computing or foundations-of-physics courses, especially those wanting accessible bridges from circuits to relativity, thermodynamics, and CTC paradoxes. Researchers looking for new physics or new information-theoretic results will not find them here, and the paper does not claim to offer them.\n\nRecommendation: send it to peer review in an education-focused venue, not as a standard research paper in quant-ph. A qualified referee can help the author sharpen the CTC framing, add modest evidence of use, and make the distinction between simulated CTCs and classical conditionals explicit from the start. The EPR and Szilard activities are worth preserving; the CTC activity needs rework before it can carry the weight the abstract places on it.","headline":"A clear, honest education paper that repackages known results; the Szilard circuit is the one genuinely fresh classroom piece, but the CTC activity hardcodes its answer and the paper admits it.","tokens_in":16079,"tokens_out":1513,"would_cite":false,"duration_ms":19782,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper shows that three thought experiments from relativity, thermodynamics, and time-travel can be implemented as small quantum circuits and run on current devices, giving learners hands-on access to the underlying principles.","keywords":["quantum computing education","quantum circuits","EPR paradox","locality","Maxwell's demon","Landauer's principle","closed timelike curves","quantum thermodynamics"],"falsifier":"The central claim would be falsified by a simple classroom test: show learners a new non-orthogonal input state, ask them to predict the circuit's output before running it, and check whether their prediction is better than the hardcoded input–output table would allow.","tokens_in":1729,"feed_emoji":"⏳","tokens_out":2065,"duration_ms":94930,"temperature":0.7,"pith_summary":"Quantum computing is usually taught as a discipline of its own, but this paper argues that its circuits can also be laboratories for fundamental physics. The author presents three quantum-circuit activities that learners can run on current and near-term hardware: an EPR experiment that demonstrates locality and no-signalling, a quantum Szilard engine that exhibits the work cost of erasing information, and a simulated closed timelike curve that resolves the Grandfather Paradox and displays the extra computational power time-loops would provide. The aim is to teach both directions at once: learners see special relativity, general relativity, and thermodynamics from a quantum-information angle, and they learn about the scope and limits of quantum computers by seeing how entanglement, erasure, and non-linearity behave in circuits.","feed_headline":"Quantum circuits let learners test relativity, entropy, and time loops","feed_subtitle":"How entanglement stays local, why erasure costs work, and how time loops beat ordinary quantum computers","key_machinery":"The unifying device is a translation of thought experiments into quantum circuits in which measurements are replaced by CNOT gates that copy a system's state into a memory qubit, so the entire evolution stays unitary and information flow can be traced. The locality argument uses a 'descriptor'—the vector of Pauli observables $(\\hat{\\sigma}_x,\\hat{\\sigma}_y,\\hat{\\sigma}_z)$ of each qubit—and the proven fact that a gate changes only the descriptor of the qubit it acts on. The thermodynamics argument uses a non-unitary reset (or a depolarising noise channel) to model both the thermalization of the particle and the erasure of the demon's memory. The time-loop argument rests on the consistency condition $\\rho_1 = \\operatorname{tr}_1(U(|\\psi_0\\rangle\\langle\\psi_0| \\otimes \\rho_1)U^\\dagger)$, which requires the time-loop qubit's state to be unchanged after its interaction with the system qubit.","core_discovery":"The paper's central claim is that the standard elements of these paradoxes—entangled particles, an observer's memory, a Szilard demon, and a time traveller—can be treated as quantum systems and assembled into small circuits, and that running those circuits reveals the mechanism behind each principle. For the EPR circuit, moving from classical measurement registers to CNOT gates makes the whole process unitary, and tracking the evolution of individual-qubit descriptors shows that Alice's basis choice only affects her own qubit and memory, never Bob's. For the Szilard engine, omitting the memory-reset step destroys the net work output on average, demonstrating Landauer's principle in quantum form. For the CTC circuit, the time-loop qubit is prepared in the state satisfying the consistency condition, so a single measurement can distinguish non-orthogonal states and thus replicate what a genuine time-loop computer could do.","pith_inferences":["Editorial extension: If the CTC simulation is accepted as a faithful educational proxy, it offers a rare hands-on route into computational complexity—learners can literally see the gap between ordinary quantum computers and time-loop computers—though the paper only gestures at this.","Editorial extension: The descriptor-based EPR activity suggests a testable pedagogical hypothesis: students who trace information flow with descriptors may develop fewer 'spooky action' misconceptions than those taught only Bell's theorem; the paper does not run that comparison.","Editorial extension: The Szilard circuit could be extended, as the paper notes, into a fully unitary engine with explicit environment qubits, which would turn it from a logic simulation into a resource-theoretic demonstration where energy conservation is visible.","Editorial extension: The same circuit idiom—CNOT-as-measurement plus consistency-condition preparation—could be adapted to simulate other exotic resources, such as indefinite causal order, although the paper only lists these as future extensions."],"forward_implications":["Running the EPR circuit lets learners see with their own results that entangled correlations can be explained by local information flow, without faster-than-light signalling or hidden variables.","The Szilard circuit shows that a blank pure-state memory is a resource: without resetting it, the engine extracts no net work over repeated cycles, making Landauer's principle tangible.","The CTC circuit distinguishes $|0\\rangle$ and $|-\\rangle$, and then all four BB84 states, with a single measurement, illustrating why time-loops would break quantum cryptography and outclass ordinary quantum computers.","These observations expose open questions, including the knowledge paradox and the tension between CTCs and locality, giving learners a view of live research problems.","Because the circuits run on current devices, the activities are usable today in classrooms and workshops, not only in thought."],"supporting_citations":[{"why":"Supplies the consistency condition that resolves the Grandfather Paradox and is the non-linearity the CTC circuits simulate.","marker":"[3]"},{"why":"Establishes that access to closed timelike curves makes quantum and classical computation equivalent and places the power in PSPACE.","marker":"[4]"},{"why":"Provides the protocol the paper implements for distinguishing non-orthogonal states with a single measurement, including the four-state BB84-breaking version.","marker":"[5]"},{"why":"Provides the descriptor/observable method that underlies the local account of the EPR circuit.","marker":"[8]"},{"why":"States Landauer's principle, the irreducible erasure cost that the Szilard circuit demonstrates.","marker":"[14]"},{"why":"Shows that measurement can be done at arbitrarily small work cost and that memory erasure saves the second law, the resolution the circuit illustrates.","marker":"[15]"},{"why":"Introduces Szilard's single-particle engine, the classical cycle that the quantum circuit maps qubit by qubit.","marker":"[21]"},{"why":"Shows quantum-state cloning is possible with closed timelike curves, the consequence behind the unbounded-information claims the circuit illustrates.","marker":"[35]"}],"fun_headline_variants":["Test time travel and entropy on a quantum computer","Quantum circuits simulate time loops and Landauer's principle","Explore causality and time-travel paradoxes with quantum circuits","Run time-loop and entropy paradoxes on real quantum hardware"],"cache_read_input_tokens":18304,"weakest_assumption_plain":"The time-travel activity stands on the premise that manually setting the time-loop qubit to the state that satisfies the consistency condition is a faithful stand-in for a real closed timelike curve; if that preparation is just hardcoding the expected answer, the claimed demonstration of extra computational power collapses.","fun_headline_variants_meta":{"raw":{"variants":["Test time travel and entropy on a quantum computer","Quantum circuits simulate time loops and Landauer's principle","Explore causality and time-travel paradoxes with quantum circuits","Run time-loop and entropy paradoxes on real quantum hardware"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00038,"raw_usage":{"total_tokens":1970,"prompt_tokens":851,"completion_tokens":1119,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":467,"completion_tokens_details":{"reasoning_tokens":1055}},"tokens_in":467,"tokens_out":1119,"duration_ms":9602,"temperature":1.0,"reasoning_tokens":1055,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T23:45:06.759960+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"The central claim would be falsified by a simple classroom test: show learners a new non-orthogonal input state, ask them to predict the circuit's output before running it, and check whether their prediction is better than the hardcoded input–output table would allow.","supporting_citations":[{"cited_title":"Quantum mechanics near closed timelike lines,","cited_arxiv_id":null,"evidence_quote":"Supplies the consistency condition that resolves the Grandfather Paradox and is the non-linearity the CTC circuits simulate."},{"cited_title":"Closed timelike curves make quantum and classical computing equivalent,","cited_arxiv_id":null,"evidence_quote":"Establishes that access to closed timelike curves makes quantum and classical computation equivalent and places the power in PSPACE."},{"cited_title":"Localized closed time- like curves can perfectly distinguish quantum states,","cited_arxiv_id":null,"evidence_quote":"Provides the protocol the paper implements for distinguishing non-orthogonal states with a single measurement, including the four-state BB84-breaking version."},{"cited_title":"Information flow in entangled quantum systems,","cited_arxiv_id":null,"evidence_quote":"Provides the descriptor/observable method that underlies the local account of the EPR circuit."},{"cited_title":"Irreversibility and heat generation in the computing process,","cited_arxiv_id":null,"evidence_quote":"States Landauer's principle, the irreducible erasure cost that the Szilard circuit demonstrates."},{"cited_title":"The thermodynamics of computation—a review,","cited_arxiv_id":null,"evidence_quote":"Shows that measurement can be done at arbitrarily small work cost and that memory erasure saves the second law, the resolution the circuit illustrates."},{"cited_title":"¨Uber die entropieverminderung in einem thermodynamis- chen system bei eingriffen intelligenter wesen,","cited_arxiv_id":null,"evidence_quote":"Introduces Szilard's single-particle engine, the classical cycle that the quantum circuit maps qubit by qubit."},{"cited_title":"Quantum-state cloning in the presence of a closed timelike curve,","cited_arxiv_id":null,"evidence_quote":"Shows quantum-state cloning is possible with closed timelike curves, the consequence behind the unbounded-information claims the circuit illustrates."}],"review_version":1}