Pith. sign in

REVIEW 2 major objections 129 references

A quantum primitive for output-hiding function sharing enables secure joint functions in QKD and computation without extra keys or communication.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-30 09:18 UTC pith:2MCFPCXC

load-bearing objection This paper asserts a new quantum primitive for output-hiding function sharing but supplies no construction, protocol, or security argument. the 2 major comments →

arxiv 2606.28997 v1 pith:2MCFPCXC submitted 2026-06-27 quant-ph

Quantum Primitive for Output-Hiding Function Sharing: QKD and Joint Computation Applications

Olivia R. Hartzell This is my paper
classification quant-ph
keywords quantum primitiveoutput-hiding function sharingQKDjoint computationinformation-theoretic securityquantum communicationsecure multi-party computation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a quantum primitive called output-hiding function sharing. This primitive lets parties encode joint functions or decisions that stay hidden information-theoretically from external observers and from participants inside the quantum system. Applications to quantum key distribution deliver improved security and efficiency compared with existing protocols. The construction avoids any need for additional private keys, hidden randomness, or classical communication. Potential uses include financial transactions, joint signaling or coordination, and navigation systems.

Core claim

The paper establishes a quantum primitive for output-hiding function sharing that encodes joint functions or decisions so their outputs remain information-theoretically hidden from both external parties and parties internal to the quantum system, without additional private keys, hidden randomness, or classical communication, thereby providing enhanced security and efficiency in QKD protocols.

What carries the argument

The output-hiding function sharing primitive, a quantum mechanism that encodes joint functions so that their outputs are hidden information-theoretically from all parties.

Load-bearing premise

Such a quantum primitive can be realized while achieving the claimed information-theoretic hiding and efficiency without using the auxiliary resources the abstract says are unnecessary.

What would settle it

An explicit construction or impossibility proof showing that any quantum protocol achieving output-hiding function sharing must employ at least one of private keys, hidden randomness, or classical communication to reach information-theoretic security.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • QKD protocols gain notable security and efficiency improvements over status-quo methods.
  • Parties can encode and execute joint functions or decisions while keeping the outputs hidden from everyone involved.
  • The same primitive supports applications in financial transactions, joint signaling, coordination decisions, and navigation systems.
  • No classical communication channel or extra randomness is required to maintain the hiding property.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The primitive may allow quantum networks to reduce reliance on classical side channels for certain multi-party tasks.
  • It could be combined with existing QKD hardware to add function-hiding layers without new infrastructure.
  • Similar hiding properties might extend to other quantum communication settings where joint decisions must stay private even from the executing devices.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 0 minor

Summary. The manuscript introduces a quantum primitive termed 'Output-Hiding Function Sharing' and discusses its applications to QKD and joint computation protocols. It asserts that the primitive enables information-theoretically hidden encoding of joint functions or decisions from both external parties and those internal to the quantum system, without private keys, hidden randomness, or classical communication, yielding enhanced security and efficiency relative to existing protocols for use cases including financial transactions, joint signaling, and navigation systems.

Significance. If a construction meeting the stated resource-free and information-theoretic security properties were provided and verified, the primitive could offer substantial improvements in quantum cryptography by removing common auxiliary requirements. The current manuscript supplies no such construction, rendering the significance unassessable.

major comments (2)
  1. [Abstract] Abstract: The manuscript asserts the existence of a quantum primitive achieving output-hiding function sharing with information-theoretic security against external and internal parties while using none of the listed auxiliary resources, yet supplies no security definition, protocol description, mathematical formulation, or reduction. This absence is load-bearing for every claimed application and property.
  2. [Throughout the manuscript] Throughout the manuscript: No technical content, equations, or evidence is present to support the central claim that the primitive can be realized without private keys, hidden randomness, or classical communication while preserving the stated hiding properties. The absence prevents any evaluation of internal consistency or realizability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their review and comments on the manuscript. We address each major comment below and outline planned revisions to strengthen the technical foundation.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The manuscript asserts the existence of a quantum primitive achieving output-hiding function sharing with information-theoretic security against external and internal parties while using none of the listed auxiliary resources, yet supplies no security definition, protocol description, mathematical formulation, or reduction. This absence is load-bearing for every claimed application and property.

    Authors: The referee correctly identifies that the abstract states the existence and properties of the primitive without accompanying formal definitions or constructions in the current text. The manuscript emphasizes applications to QKD and joint computation, but these claims rest on the primitive's stated properties. In revision we will add an explicit security definition (including the information-theoretic hiding requirements against external and internal parties), a protocol description, and a mathematical formulation with a high-level security argument showing how the hiding holds without private keys, hidden randomness, or classical communication. revision: yes

  2. Referee: [Throughout the manuscript] Throughout the manuscript: No technical content, equations, or evidence is present to support the central claim that the primitive can be realized without private keys, hidden randomness, or classical communication while preserving the stated hiding properties. The absence prevents any evaluation of internal consistency or realizability.

    Authors: We agree that the current manuscript contains no equations, protocol steps, or evidence supporting realizability of the claimed properties. The text is limited to a high-level description of applications. To enable evaluation of consistency and realizability, the revised version will incorporate the necessary technical content: a formal model of the primitive, the resource constraints, and an argument (or reduction) establishing that the output-hiding property holds under the stated conditions. revision: yes

Circularity Check

0 steps flagged

No derivation chain or equations present; circularity assessment inapplicable

full rationale

The supplied manuscript text consists solely of an abstract asserting properties of a 'proposed primitive' for output-hiding function sharing and its applications, without any definitions, protocols, security models, equations, or derivation steps. No load-bearing claims reduce to inputs by construction, self-citation, or fitted parameters because no such technical structure exists. Per the rules, absence of a derivation chain warrants a non-finding of circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No full manuscript text is available; the abstract alone supplies no free parameters, axioms, or invented entities that can be extracted.

pith-pipeline@v0.9.1-grok · 5619 in / 1080 out tokens · 33010 ms · 2026-06-30T09:18:03.972820+00:00 · methodology

0 comments
read the original abstract

Applications of the proposed primitive: Quantum Primitive for Output-Hiding Function Sharing, are discussed for secure quantum communications and computation protocols. In particular, QKD applications provide notable enhanced security and efficiency properties relative to status-quo protocols. Additionally, we provide examples when parties may wish to encode joint functions, or decisions, which remain information-theoretically hidden from external parties and those internal to the quantum system, without additional private keys, hidden randomness, or classical communication. In particular these applications may be useful in domains such as; financial transactions, joint signaling or coordination decisions, and navigation systems, among others.

Figures

Figures reproduced from arXiv: 2606.28997 by Olivia R. Hartzell.

Figure 1
Figure 1. Figure 1: Measurement outcome and recording strategy pairs, given corresponding joint unitaries, [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Measurement outcome and recording strategy pairs, given corresponding joint unitaries, [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Measurement outcome and recording strategy pairs, given corresponding joint unitaries, [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Measurement outcome and recording strategy pairs, given corresponding joint unitaries, [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Measurement outcome and recording strategy pairs, given corresponding joint unitaries, [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Measurement outcome and recording strategy pairs, given corresponding joint unitaries, [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

129 extracted references · 129 canonical work pages · 1 internal anchor

  1. [1]

    Amazon Playbook for Sellers

    Feedvisor. Amazon Playbook for Sellers

    work page

  2. [2]

    2023 , institution=

    Self-Preferencing at Amazon: Evidence from Search Rankings , author=. 2023 , institution=

    work page 2023

  3. [3]

    and Thomas, Joy A

    Cover, Thomas M. and Thomas, Joy A. , title =

    work page

  4. [4]

    Scientific Reports , volume=

    Secure Multiparty Quantum Computation for Summation and Multiplication , author=. Scientific Reports , volume=. 2016 , doi=

    work page 2016

  5. [5]

    IEEE Communications Surveys & Tutorials , volume=

    The evolution of quantum secure direct communication: On the road to the qinternet , author=. IEEE Communications Surveys & Tutorials , volume=. 2024 , publisher=

    work page 2024

  6. [6]

    Hartzell, Olivia , title =

    work page

  7. [7]

    arXiv preprint , volume =

    Hartzell, Olivia , title =. arXiv preprint , volume =. 2026 , eprint =

    work page 2026

  8. [8]

    Yang et al

    Bidirectional and cyclic quantum dense coding in a high-dimension system: X. Yang et al. , author=. Quantum Information Processing , volume=. 2020 , publisher=

    work page 2020

  9. [9]

    Physics Letters A , volume=

    Quantum dialogue , author=. Physics Letters A , volume=. 2004 , publisher=

    work page 2004

  10. [10]

    Quantum Information Processing , volume=

    Measurement device-independent quantum dialogue , author=. Quantum Information Processing , volume=. 2017 , publisher=

    work page 2017

  11. [11]

    Entropy , volume=

    Quantum Secure Multi-Party Summation with Graph State , author=. Entropy , volume=. 2024 , publisher=

    work page 2024

  12. [12]

    Entropy , volume=

    Quantum secure multi-party summation using single photons , author=. Entropy , volume=. 2023 , publisher=

    work page 2023

  13. [13]

    Quantum information processing , volume=

    Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform , author=. Quantum information processing , volume=. 2021 , publisher=

    work page 2021

  14. [14]

    Physical Review Letters , volume=

    Quantum cryptography based on Bell's theorem , author=. Physical Review Letters , volume=

    work page

  15. [15]

    Kushilevitz, Eyal and Nisan, Noam , title =

    work page

  16. [16]

    American Economic Journal: Microeconomics , volume=

    Demand estimation under incomplete product availability , author=. American Economic Journal: Microeconomics , volume=. 2013 , publisher=

    work page 2013

  17. [17]

    Available at SSRN 4733318 , year=

    Algorithmic competition, with humans , author=. Available at SSRN 4733318 , year=

    work page

  18. [18]

    Investment, and Technical Efficiencies in Mobile Telecommunications (April 25, 2023) , year=

    Market structure, investment, and technical efficiencies in mobile telecommunications , author=. Investment, and Technical Efficiencies in Mobile Telecommunications (April 25, 2023) , year=

    work page 2023

  19. [19]

    Journal of Economics & Management Strategy , volume=

    The challenges of using ranks to estimate sales , author=. Journal of Economics & Management Strategy , volume=. 2024 , publisher=

    work page 2024

  20. [20]

    Strategy Science , volume=

    The song remains the same? Technological change and positioning in the recorded music industry , author=. Strategy Science , volume=. 2016 , publisher=

    work page 2016

  21. [21]

    Management science , volume=

    Consumer surplus in the digital economy: Estimating the value of increased product variety at online booksellers , author=. Management science , volume=. 2003 , publisher=

    work page 2003

  22. [22]

    American Economic Review , volume=

    Artificial intelligence, algorithmic pricing, and collusion , author=. American Economic Review , volume=

    work page

  23. [23]

    Available at SSRN 4817542 , year=

    The Welfare Effects of Sponsored Product Advertising , author=. Available at SSRN 4817542 , year=

    work page

  24. [24]

    The RAND Journal of Economics , pages=

    Design competition through multidimensional auctions , author=. The RAND Journal of Economics , pages=. 1993 , publisher=

    work page 1993

  25. [25]

    Available at SSRN 3987361 , year=

    Self-preferencing and search neutrality in online retail platforms , author=. Available at SSRN 3987361 , year=

    work page

  26. [26]

    The Journal of finance , volume=

    Counterspeculation, auctions, and competitive sealed tenders , author=. The Journal of finance , volume=. 1961 , publisher=

    work page 1961

  27. [27]

    Public choice , pages=

    Multipart pricing of public goods , author=. Public choice , pages=. 1971 , publisher=

    work page 1971

  28. [28]

    Econometrica: Journal of the Econometric Society , pages=

    Incentives in teams , author=. Econometrica: Journal of the Econometric Society , pages=. 1973 , publisher=

    work page 1973

  29. [29]

    The RAND Journal of Economics , volume=

    Why do intermediaries divert search? , author=. The RAND Journal of Economics , volume=. 2011 , publisher=

    work page 2011

  30. [30]

    Management Science , volume=

    Information disclosure and promotion policy design for platforms , author=. Management Science , volume=. 2023 , publisher=

    work page 2023

  31. [31]

    The Quarterly Journal of Economics , volume=

    Position auctions with consumer search , author=. The Quarterly Journal of Economics , volume=. 2011 , publisher=

    work page 2011

  32. [32]

    American Economic Review , volume=

    Online advertising: Heterogeneity and conflation in market design , author=. American Economic Review , volume=. 2010 , publisher=

    work page 2010

  33. [33]

    The RAND Journal of Economics , volume=

    Targeting in advertising markets: implications for offline versus online media , author=. The RAND Journal of Economics , volume=. 2011 , publisher=

    work page 2011

  34. [34]

    HKUST Business School Research Paper , number=

    Information design of online platforms , author=. HKUST Business School Research Paper , number=

    work page

  35. [35]

    Journal of Economics & Management Strategy , volume=

    Streaming platform and strategic recommendation bias , author=. Journal of Economics & Management Strategy , volume=. 2022 , publisher=

    work page 2022

  36. [36]

    The RAND Journal of Economics , volume=

    A model of biased intermediation , author=. The RAND Journal of Economics , volume=. 2019 , publisher=

    work page 2019

  37. [37]

    Digital platforms and antitrust , author=

    work page

  38. [38]

    International Journal of Industrial Organization , volume=

    Search diversion and platform competition , author=. International Journal of Industrial Organization , volume=. 2014 , publisher=

    work page 2014

  39. [39]

    The RAND Journal of Economics , volume=

    Properties of scoring auctions , author=. The RAND Journal of Economics , volume=. 2008 , publisher=

    work page 2008

  40. [40]

    American Economic Review , volume=

    The VCG auction in theory and practice , author=. American Economic Review , volume=. 2014 , publisher=

    work page 2014

  41. [41]

    international Journal of industrial Organization , volume=

    Position auctions , author=. international Journal of industrial Organization , volume=. 2007 , publisher=

    work page 2007

  42. [42]

    American Economic Review , volume=

    Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords , author=. American Economic Review , volume=. 2007 , publisher=

    work page 2007

  43. [43]

    Econometrica , volume=

    Search, obfuscation, and price elasticities on the internet , author=. Econometrica , volume=. 2009 , publisher=

    work page 2009

  44. [44]

    Marketing Science , doi =

    Donnelly, Robert and Kanodia, Ayush and Morozov, Ilya , title =. Marketing Science , doi =

    work page

  45. [45]

    Journal of Economics & Management Strategy , year=

    The challenges of using ranks to estimate sales , author=. Journal of Economics & Management Strategy , year=

    work page

  46. [46]

    com and BarnesandNoble.com , author=

    Measuring prices and price competition online: Amazon. com and BarnesandNoble.com , author=. Quantitative marketing and Economics , volume=. 2003 , publisher=

    work page 2003

  47. [47]

    2022 , institution=

    Demand analysis under latent choice constraints , author=. 2022 , institution=

    work page 2022

  48. [48]

    2021 , institution=

    Algorithmic competition, with humans , author=. 2021 , institution=

    work page 2021

  49. [49]

    Harvard Journal of Law & Technology, Forthcoming , year=

    Amazon's Pricing Paradox , author=. Harvard Journal of Law & Technology, Forthcoming , year=

    work page

  50. [50]

    Job Market Paper, New York University , year=

    The welfare consequences of regulating Amazon , author=. Job Market Paper, New York University , year=

    work page

  51. [51]

    2022 , publisher=

    Pure-Strategy Equilibrium in the Generalized First-Price Auction , author=. 2022 , publisher=

    work page 2022

  52. [52]

    Platform search design and market power , author=

    work page

  53. [53]

    2023 , institution=

    A Framework for Detection, Measurement, and Welfare Analysis of Platform Bias , author=. 2023 , institution=

    work page 2023

  54. [54]

    2021 , institution=

    Entry into two-sided markets shaped by platform-guided search , author=. 2021 , institution=

    work page 2021

  55. [55]

    International Journal of Industrial Organization , volume=

    Algorithmic collusion with imperfect monitoring , author=. International Journal of Industrial Organization , volume=. 2021 , publisher=

    work page 2021

  56. [56]

    Econometrica: Journal of the Econometric Society , pages=

    A theory of dynamic oligopoly, II: Price competition, kinked demand curves, and Edgeworth cycles , author=. Econometrica: Journal of the Econometric Society , pages=. 1988 , publisher=

    work page 1988

  57. [57]

    Unpublished manuscript, Stanford University , year=

    Contracting and vertical control by a dominant platform , author=. Unpublished manuscript, Stanford University , year=

    work page

  58. [58]

    Steering in One Click: Platform Self-Preferencing in the Amazon Buy Box , author=

    work page

  59. [59]

    Proceedings of the 23rd ACM Conference on Economics and Computation , pages=

    Algorithmic Pricing Facilitates Tacit Collusion: Evidence from E-Commerce , author=. Proceedings of the 23rd ACM Conference on Economics and Computation , pages=

    work page

  60. [60]

    2021 , institution=

    Artificial intelligence and pricing: The impact of algorithm design , author=. 2021 , institution=

    work page 2021

  61. [61]

    The RAND Journal of Economics , volume=

    Autonomous algorithmic collusion: Q-learning under sequential pricing , author=. The RAND Journal of Economics , volume=. 2021 , publisher=

    work page 2021

  62. [62]

    Harvard Law School , year=

    Steering in One Click: Platform Self-Preferencing in the Amazon Buy Box , author=. Harvard Law School , year=

    work page

  63. [63]

    Sixth ad auctions workshop , volume=

    A structural model of sponsored search advertising auctions , author=. Sixth ad auctions workshop , volume=

    work page

  64. [64]

    Journal of Economic Theory , volume=

    Payoff information and self-confirming equilibrium , author=. Journal of Economic Theory , volume=. 1999 , publisher=

    work page 1999

  65. [65]

    Econometrica: Journal of the Econometric Society , pages=

    Automobile prices in market equilibrium , author=. Econometrica: Journal of the Econometric Society , pages=. 1995 , publisher=

    work page 1995

  66. [66]

    The Journal of Industrial Economics , volume=

    Edgeworth price cycles: Evidence from the Toronto retail gasoline market , author=. The Journal of Industrial Economics , volume=. 2007 , publisher=

    work page 2007

  67. [67]

    Energy Economics , volume=

    Edgeworth price cycles and intertemporal price discrimination , author=. Energy Economics , volume=. 2012 , publisher=

    work page 2012

  68. [68]

    Journal of Economics & Management Strategy , volume=

    Edgeworth price cycles and focal prices: Computational dynamic Markov equilibria , author=. Journal of Economics & Management Strategy , volume=. 2008 , publisher=

    work page 2008

  69. [69]

    Available at SSRN 3753903 , year=

    Platform design when sellers use pricing algorithms , author=. Available at SSRN 3753903 , year=

    work page

  70. [70]

    Review of Economics and Statistics , volume=

    The speed of gasoline price response in markets with and without Edgeworth cycles , author=. Review of Economics and Statistics , volume=. 2011 , publisher=

    work page 2011

  71. [71]

    arXiv preprint , eprint =

    Artificial Intelligence and Auction Design , author =. arXiv preprint , eprint =

    work page

  72. [72]

    Marketing Science , volume=

    Frontiers: Algorithmic collusion: Supra-competitive prices via independent algorithms , author=. Marketing Science , volume=. 2021 , publisher=

    work page 2021

  73. [73]

    2021 , institution=

    Competition in pricing algorithms , author=. 2021 , institution=

    work page 2021

  74. [74]

    Proceedings of the 4th ACM conference on Electronic Commerce , pages=

    k-Implementation , author=. Proceedings of the 4th ACM conference on Electronic Commerce , pages=

    work page

  75. [75]

    2021 , howpublished =

    American Innovation and Choice Online Act , author =. 2021 , howpublished =

    work page 2021

  76. [76]

    Review of Economic Design , volume=

    Optimal design of scoring auctions with multidimensional quality , author=. Review of Economic Design , volume=. 2015 , publisher=

    work page 2015

  77. [77]

    2009 , publisher=

    Nudge: Improving decisions about health, wealth, and happiness , author=. 2009 , publisher=

    work page 2009

  78. [78]

    Econometrica , volume =

    Choi, Michael and Dai, Anovia Yifan and Kim, Kyungmin , title =. Econometrica , volume =. doi:https://doi.org/10.3982/ECTA14837 , url =. https://onlinelibrary.wiley.com/doi/pdf/10.3982/ECTA14837 , year =

    work page doi:10.3982/ecta14837

  79. [79]

    The Economic Journal , volume=

    Paying for prominence , author=. The Economic Journal , volume=. 2011 , publisher=

    work page 2011

  80. [80]

    The RAND Journal of Economics , volume=

    Should platforms be allowed to sell on their own marketplaces? , author=. The RAND Journal of Economics , volume=. 2022 , publisher=

    work page 2022

Showing first 80 references.